Skip to Main content Skip to Navigation
Journal articles

Petri Nets Analysis: Complexity and Finite Coverability Graph in Modular Design

Didier Crestani 1 Alain Jean-Marie 2 Christine Coves 3
1 EXPLORE - Robotique mobile pour l'exploration de l'environnement
LIRMM - Laboratoire d'Informatique de Robotique et de Microélectronique de Montpellier
2 APR - Algorithmes et Performance des Réseaux
LIRMM - Laboratoire d'Informatique de Robotique et de Microélectronique de Montpellier
Abstract : The Petri net is a very efficient model to describe and analyse the behaviour of Discrete Event Systems. However, faced to the complexity, modular design is needed to deal with large systems. The coverability graph is a useful tool allowing to analyse system's properties. But its capacities are limited to finite coverability graph merging for modular design. This paper studies the temporal complexity of finite coverability graph construction using the minimal coverability graph algorithm. It focuses on modular design using shared transitions and concludes on the advantages and drawbacks of this class of approach.
Document type :
Journal articles
Complete list of metadata

Cited literature [6 references]  Display  Hide  Download

https://hal-lirmm.ccsd.cnrs.fr/lirmm-00105305
Contributor : Christine Carvalho de Matos <>
Submitted on : Wednesday, October 11, 2006 - 7:51:16 AM
Last modification on : Tuesday, December 17, 2019 - 2:24:02 PM
Long-term archiving on: : Tuesday, April 6, 2010 - 7:16:43 PM

File

Identifiers

  • HAL Id : lirmm-00105305, version 1

Collections

Citation

Didier Crestani, Alain Jean-Marie, Christine Coves. Petri Nets Analysis: Complexity and Finite Coverability Graph in Modular Design. Studies in Informatics and Control, Informatics and Control Publications, 2005, 14 (1), pp.55-64. ⟨lirmm-00105305⟩

Share