Complexity Analysis of Continuous Petri Nets

Estíbaliz Fraca (1) , Serge Haddad (2, 3)

1 University of Zaragoza - Universidad de Zaragoza [Zaragoza]
2 LSV - Laboratoire Spécification et Vérification [Cachan]
3 MEXICO - Modeling and Exploitation of Interaction and Concurrency

At the end of the eighties, continuous Petri nets were introduced for: (1) alleviating the combinatory explosion triggered by discrete Petri nets and, (2) modelling the behaviour of physical systems whose state is composed of continuous variables. Since then several works have established that the computational complexity of deciding some standard behavioural properties of Petri nets is reduced in this framework. Here we first establish the decidability of additional properties like boundedness and reachability set inclusion. We also design new decision procedures for the reachability and lim-reachability problems with a better computational complexity. Finally we provide lower bounds characterising the exact complexity class of the boundedness, the reachability, the deadlock freeness and the liveness problems.

Domaines: Théorie et langage formel [cs.FL]

Estíbaliz Fraca, Serge Haddad. Complexity Analysis of Continuous Petri Nets. 34th International Conference on Applications and Theory of Petri Nets (ICATPN'13), 2013, Italy. pp.170-189, ⟨10.1007/978-3-642-38697-8_10⟩. ⟨hal-00926196⟩