inria-00073851, version 1
Liveness in Free-Choice Petri Nets : An Algebraic Approach
François Baccelli
1Bruno Gaujal 2
N° RR-2839 (1996)
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.
- 1: MISTRAL (INRIA Sophia Antipolis)
- INRIA
- 2: SLOOP (INRIA Sophia Antipolis / Laboratoire I3S)
- INRIA – Université de Nice Sophia Antipolis (UNS) – CNRS : UMR7271
- Domain : Computer Science/Other
- Keywords : PETRI NETS / (MIN / +) ALGEBRA / LIVENESS
- Internal note : RR-2839
- inria-00073851, version 1
- http://hal.inria.fr/inria-00073851
- oai:hal.inria.fr:inria-00073851
- From: Rapport De Recherche Inria
- Submitted on: Wednesday, 24 May 2006 13:54:27
- Updated on: Wednesday, 31 May 2006 14:24:28
Associated documents
Export