Recursive Petri nets

Abstract. 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. Key words. Petri nets – Expressivity – Reachability problem – Bisimulation – Flows computation

• Type: Journal
• Year: 2007
• Where: ACTA
• Authors: Serge Haddad, Denis Poitrenaud
• Keywords: ACTA 2007, Discrete Event Systems, Ordinary Petri Nets, Recursive Petri Nets