Abstract (EN)

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 finiteness 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.