Continuous Petri nets: expressive power and decidability issues

Authors:
Laura Recalde;Serge Haddad;Manuel Silva
Affiliations:
GISED, University of Zaragoza, Spain;LAMSADE-CNRS, UMR, University Paris-Dauphine, France;GISED, University of Zaragoza, Spain
Venue:
ATVA'07 Proceedings of the 5th international conference on Automated technology for verification and analysis
Year:
2007

Citing 7
Cited 2

Decidability results in First–Order Hybrid PetriNets

Discrete Event Dynamic Systems
Toward a Definition of Modeling Power for Stochastic Petri Net Models

PNPM '87 The Proceedings of the Second International Workshop on Petri Nets and Performance Models
Linear Algebraic and Linear Programming Techniques for the Analysis of Place or Transition Net Systems

Lectures on Petri Nets I: Basic Models, Advances in Petri Nets, the volumes are based on the Advanced Course on Petri Nets
Formal languages and their relation to automata

Formal languages and their relation to automata
On reachability in autonomous continuous Petri net systems

ICATPN'03 Proceedings of the 24th international conference on Applications and theory of Petri nets
On the computational power of timed differentiable petri nets

FORMATS'06 Proceedings of the 4th international conference on Formal Modeling and Analysis of Timed Systems
Continuization of timed petri nets: from performance evaluation to observation and control

ICATPN'05 Proceedings of the 26th international conference on Applications and Theory of Petri Nets

Modeling and simulation by hybrid Petri nets

Proceedings of the Winter Simulation Conference
Spatial modeling in cell biology at multiple levels

Proceedings of the Winter Simulation Conference

Quantified Score

Hi-index	0.00

Visualization

Abstract

State explosion is a fundamental problem in the analysis and synthesis of discrete event systems. Continuous Petri nets can be seen as a relaxation of discrete models. The expected gains are twofold: improvements in comlexity and in decidability. This paper concentrates on the study of decidability issues. In the case of autonomous nets it is proved that properties like reachability, liveness or deadlock-freeness remain decidable. When time is introduced in the model (using an infinite server semantics) decidability of these properties is lost, since continuous timed Petri nets are able to simulate Turing machines.