Modelling and Analyzing Systems with Recursive Petri Nets

Serge Haddad Denis Poitrenaud 1
1 SRC - Systèmes répartis et coopératifs
LIP6 - Laboratoire d'Informatique de Paris 6
Abstract : Recursive Petri nets (RPNs) have been introduced to model systems with dynamic structure. In a previous work, we have shown that this model is a strict extension of Petri nets, whereas reachability in RPNs remains decidable. Here, we focus on its modelling features and on some additional theoretical aspects. Three different kinds of discrete event systems are modellized by RPNs in order to give an insight of their capabilities to express various mechanisms. Decision procedures for new properties like boundedness and fmiteness are presented and recursiveness of languages of RPNs is proved. At last, we compare RPNs with two other models combining Petri nets and context-free grammars features showing that these models can be simulated by RPNs.
Document type :
Conference papers
Complete list of metadatas

https://hal.archives-ouvertes.fr/hal-01573071
Contributor : Lip6 Publications <>
Submitted on : Tuesday, August 8, 2017 - 2:42:00 PM
Last modification on : Thursday, March 21, 2019 - 1:09:49 PM

Links full text

Identifiers

Citation

Serge Haddad, Denis Poitrenaud. Modelling and Analyzing Systems with Recursive Petri Nets. 5th Workshop on Discrete Event Systems (WODES '2000), Aug 2000, Ghent, Belgium. pp.449-458, ⟨10.1007/978-1-4615-4493-7_48⟩. ⟨hal-01573071⟩

Share

Metrics

Record views

191