Liveness in Free-Choice Petri Nets : An Algebraic Approach

François Baccelli 1 Bruno Gaujal 2
2 SLOOP - Simulation, Object Oriented Languages and Parallelism
CRISAM - Inria Sophia Antipolis - Méditerranée , Laboratoire I3S - COMRED - COMmunications, Réseaux, systèmes Embarqués et Distribués
Abstract : In this paper, we show that the evolution equations for timed free choice Petri net can be used to prove logical properties of the underlying un-timed net. For example, this approach leads to new methods and algorithms to check liveness and several other basic properties, such as absence or presence of deadlocks. The main tools for proving these properties are graph theory and idempotent algebras.
Type de document :
Rapport
RR-2839, INRIA. 1996
Liste complète des métadonnées

https://hal.inria.fr/inria-00073851
Contributeur : Rapport de Recherche Inria <>
Soumis le : mercredi 24 mai 2006 - 13:54:27
Dernière modification le : lundi 5 novembre 2018 - 15:36:03
Document(s) archivé(s) le : lundi 5 avril 2010 - 00:00:11

Fichiers

Identifiants

  • HAL Id : inria-00073851, version 1

Collections

Citation

François Baccelli, Bruno Gaujal. Liveness in Free-Choice Petri Nets : An Algebraic Approach. RR-2839, INRIA. 1996. 〈inria-00073851〉

Partager

Métriques

Consultations de la notice

255

Téléchargements de fichiers

145