Recursive Petri nets - Theory and application to discrete event systems - Archive ouverte HAL Accéder directement au contenu
Article Dans Une Revue Acta Informatica Année : 2007

Recursive Petri nets - Theory and application to discrete event systems

Serge Haddad
Denis Poitrenaud
  • Fonction : Auteur
  • PersonId : 968343

Résumé

In order to design and analyse complex systems, modelers need formal models with two contradictory requirements: a high expressivity and the decidability of behavioural property checking. Here we present and develop the theory of such a model, the recursive Petri nets. First, we show that the mechanisms supported by recursive Petri nets enable to model patterns of discrete event systems related to the dynamic structure of processes. Furthermore, we prove that these patterns cannot be modelled by ordinary Petri nets. Then we study the decidability of some problems: reachability, finiteness and bisimulation. At last, we develop the concept of linear invariants for this kind of nets and we design efficient computations specifically tailored to take advantage of their structure.

Dates et versions

hal-01175914 , version 1 (13-07-2015)

Identifiants

Citer

Serge Haddad, Denis Poitrenaud. Recursive Petri nets - Theory and application to discrete event systems. Acta Informatica, 2007, 44 (7-8), pp.463-508. ⟨10.1007/s00236-007-0055-y⟩. ⟨hal-01175914⟩
59 Consultations
0 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More