The expressive power of time Petri nets

We investigate expressiveness questions for time Petri nets (TPNs) and some of their most useful extensions. We first introduce generalised time Petri nets (GTPNs) as an abstract model that encompasses variants of TPNs such as self modifications and read, reset and inhibitor arcs. We give a syntactical translation from bounded GTPNs to timed automata (TA) that generates isomorphic transition systems. We prove that the class of bounded GTPNs is strictly less expressive than TA w.r.t. weak timed bisimilarity. We prove that bounded GTPNs, bounded TPNs and TA are equally expressive w.r.t. timed language acceptance. Finally, we characterise a syntactical subclass of TA that is equally expressive to bounded GTPNs ''a la Merlin'' w.r.t. weak timed bisimilarity. These results provide a unified comparison of the expressiveness of many variants of timed models often used in practice. It leads to new important results for TPNs. Among them are: 1-safe TPNs and bounded-TPNs are equally expressive; @e-transitions strictly increase the expressive power of TPNs; self modifying nets as well as read, inhibitor and reset arcs do not add expressiveness to bounded TPNs.

[1]  Didier Lime,et al.  Reachability Problems and Abstract State Spaces for Time Petri Nets with Stopwatches , 2007, Discret. Event Dyn. Syst..

[2]  Anna Philippou,et al.  Tools and Algorithms for the Construction and Analysis of Systems , 2018, Lecture Notes in Computer Science.

[3]  M. Diaz,et al.  Modeling and Verification of Time Dependent Systems Using Time Petri Nets , 1991, IEEE Trans. Software Eng..

[4]  Marc Boyer,et al.  On the Compared Expressiveness of Arc, Place and Transition Time Petri Nets , 2008, Fundam. Informaticae.

[5]  Jirí Srba,et al.  An Efficient Translation of Timed-Arc Petri Nets to Networks of Timed Automata , 2009, ICFEM.

[6]  Rüdiger Valk.  Self-Modifying Nets, a Natural Extension of Petri Nets , 1978, ICALP.

[7]  G. G. Stokes.  "J." , 1890, The New Yale Book of Quotations.

[8]  李幼升,et al.  Ph , 1989 .

[9]  François Vernadat,et al.  Bridging the Gap Between Timed Automata and Bounded Time Petri Nets , 2006, FORMATS.

[10]  Neil D. Jones,et al.  Complexity of Some Problems in Petri Nets , 1977, Theor. Comput. Sci..

[11]  Catherine Dufourd.  Reseaux de petri avec reset/transfert : decidabilite et indecidabilite , 1998 .

[12]  Philippe Schnoebelen,et al.  Reset Nets Between Decidability and Undecidability , 1998, ICALP.

[13]  Serge Haddad,et al.  When Are Timed Automata Weakly Timed Bisimilar to Time Petri Nets? , 2005, FSTTCS.

[14]  Jirí Srba,et al.  Comparing the Expressiveness of Timed Automata and Timed Extensions of Petri Nets , 2008, FORMATS.

[15]  Aydin Aybar,et al.  Supervisory controller design to enforce some basic properties in timed-transition Petri nets using stretching , 2012 .

[16]  Serge Haddad,et al.  Comparison of Different Semantics for Time Petri Nets , 2005, ATVA.

[17]  Paul Gastin,et al.  Characterization of the Expressive Power of Silent Transitions in Timed Automata , 1998, Fundam. Informaticae.

[18]  C. Ramchandani,et al.  Analysis of asynchronous concurrent systems by timed petri nets , 1974 .

[19]  Françoise Simonot-Lion,et al.  On Equivalence between Timed State Machines and Time Petri Nets , 2000 .

[20]  Tadao Kasami,et al.  Some Decision Problems Related to the Reachability Problem for Petri Nets , 1976, Theor. Comput. Sci..

[21]  Olivier H. Roux,et al.  Structural translation from Time Petri Nets to Timed Automata , 2005, J. Syst. Softw..

[22]  David de Frutos-Escrig,et al.  Decidability of Properties of Timed-Arc Petri Nets , 2000, ICATPN.

[23]  Satoshi Yamane,et al.  The symbolic model-checking for real-time systems , 1996, Proceedings of the Eighth Euromicro Workshop on Real-Time Systems.

[24]  Didier Lime,et al.  Model Checking of Time Petri Nets Using the State Class Timed Automaton , 2006, Discret. Event Dyn. Syst..

[25]  Louchka Popova-Zeugmann,et al.  Quantitative evaluation of time-dependent Petri nets and applications to biochemical networks , 2011, Natural Computing.

[26]  Parosh Aziz Abdulla,et al.  Timed Petri Nets and BQOs , 2001, ICATPN.

[27]  Hans-Michael Hanisch.  Analysis of Place/Transition Nets with Timed Arcs and its Application to Batch Process Control , 1993, Application and Theory of Petri Nets.

[28]  Rajeev Alur,et al.  A Theory of Timed Automata , 1994, Theor. Comput. Sci..

[29]  L. Kaiser,et al.  Equivalence of timed state machines and safe TPN , 2002, Sixth International Workshop on Discrete Event Systems, 2002. Proceedings..

[30]  S. Calvez,et al.  P-Time Petri Nets for Manufacturing Systems with Staying Time Constraints , 1997 .

[31]  Didier Lime,et al.  Romeo: A Tool for Analyzing Time Petri Nets , 2005, CAV.

[32]  Simona Bernardi,et al.  Computation of Performance Bounds for Real-Time Systems Using Time Petri Nets , 2009, IEEE Transactions on Industrial Informatics.

[33]  Thomas A. Henzinger,et al.  Event-Clock Automata: A Determinizable Class of Timed Automata , 1999, Theor. Comput. Sci..

[34]  Patricia Bouyer,et al.  Extended Timed Automata and Time Petri Nets , 2006, Sixth International Conference on Application of Concurrency to System Design (ACSD'06).

[35]  Joseph Sifakis.  Performance Evaluation of Systems Using Nets , 1979, Advanced Course: Net Theory and Applications.

[36]  Philip Meir Merlin,et al.  A study of the recoverability of computing systems. , 1974 .

[37]  Serge Haddad,et al.  Comparison of the Expressiveness of Timed Automata and Time Petri Nets , 2005, FORMATS.

[38]  Didier Lime,et al.  Romeo: A Parametric Model-Checker for Petri Nets with Stopwatches , 2009, TACAS.

[39]  F. Vernadat,et al.  The tool TINA – Construction of abstract state spaces for petri nets and time petri nets , 2004 .