Petri Nets Analysis: Complexity and Finite Coverability Graph in Modular Design - LIRMM - Laboratoire d’Informatique, de Robotique et de Microélectronique de Montpellier Access content directly
Journal Articles Studies in Informatics and Control Year : 2005

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

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.
Fichier principal
Vignette du fichier
D488.PDF (45.97 Ko) Télécharger le fichier
Loading...

Dates and versions

lirmm-00105305 , version 1 (11-10-2006)

Identifiers

  • HAL Id : lirmm-00105305 , version 1

Cite

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

Share

Gmail Mastodon Facebook X LinkedIn More