On the Compared Expressiveness of Arc, Place and Transition Time Petri Nets

In this paper, we consider safe Time Petri Nets where time intervals (strict and large) are associated with places (P-TPN), arcs (A-TPN) or transitions (T-TPN). We give the formal strong and weak semantics of these models in terms of Timed Transition Systems. We compare the expressiveness of the six models w.r.t. (weak) timed bisimilarity (behavioral semantics). The main results of the paper are : (i) with strong semantics, A-TPN is strictly more expressive than P-TPN and T-TPN ; (ii) with strong semantics P-TPN and T-TPN are incomparable ; (iii) T-TPN with strong semantics and T-TPN with weak semantics are incomparable. Moreover, we give a complete classification by a set of 9 relations explained in Fig. 19 (p. 247).

[1]  Johan Lilius,et al.  A causal semantics for time Petri nets , 2000, Theor. Comput. Sci..

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

[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.  Comparison of the Expressiveness of Arc, Place and Transition Time Petri Nets , 2007, ICATPN.

[5]  Marc Boyer,et al.  Multiple enabledness of transitions in Petri nets with time , 2001, Proceedings 9th International Workshop on Petri Nets and Performance Models.

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

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

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

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

[10]  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.

[11]  Wael Khansa.  Réseaux de Pétri P-Temporels : contribution à l'étude des systèmes à évènements discrets , 1997 .

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

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

[14]  Andrea Maggiolo-Schettini,et al.  Time-Based Expressivity of Time Petri Nets for System Specification , 1999, Theor. Comput. Sci..

[15]  O. H. Roux,et al.  Comparison of the expressiveness w . r . t . timed bisimilarity of k-bounded Arc , Place and Transition Time Petri Nets with weak and strong single server semantics , 2007 .

[16]  Jirí Srba.  Timed-Arc Petri Nets vs. Networks of Timed Automata , 2005, ICATPN.

[17]  Marc Boyer.  Translation from timed Petri nets with intervals on transitions to intervals on places (with urgency) , 2002, Electron. Notes Theor. Comput. Sci..

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

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

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