Timed-Arc Petri Nets

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

[2]  Richard M. Karp,et al.  Parallel Program Schemata , 1969, J. Comput. Syst. Sci..

[3]  Wang Yi,et al.  Timed Automata: Semantics, Algorithms and Tools , 2003, Lectures on Concurrency and Petri Nets.

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

[5]  Kurt Jensen,et al.  Coloured Petri Nets and the Invariant-Method , 1981, Theor. Comput. Sci..

[6]  P. Merlin,et al.  Recoverability of Communication Protocols - Implications of a Theoretical Study , 1976, IEEE Transactions on Communications.

[7]  Petru Eles,et al.  Modeling and formal verification of embedded systems based on a Petri net representation , 2003, J. Syst. Archit..

[8]  Lasse Jacobsen,et al.  Undecidability of Coverability and Boundedness for Timed-Arc Petri Nets with Invariants , 2009, MEMICS.

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

[10]  Wil M. P. van der Aalst.  Interval Timed Coloured Petri Nets and their Analysis , 1993, Application and Theory of Petri Nets.

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

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

[13]  Agata Janowska,et al.  Translation of Intermediate Language to Timed Automata with Discrete Data , 2008, Fundam. Informaticae.

[14]  Tommaso Bolognesi,et al.  From timed Petri nets to timed LOTOS , 1990, PSTV.

[15]  Keith A. Bartlett,et al.  A note on reliable full-duplex transmission over half-duplex links , 1969, Commun. ACM.

[16]  M. Hack,et al.  PETRI NET LANGUAGE , 1976 .

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

[18]  Gerd Behrmann,et al.  Adding Symmetry Reduction to Uppaal , 2003, FORMATS.

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

[20]  Patricia Bouyer,et al.  Timed Petri nets and timed automata: On the discriminating power of zeno sequences , 2008, Inf. Comput..

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

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

[23]  David L. Dill,et al.  Better verification through symmetry , 1996, Formal Methods Syst. Des..

[24]  C. Petri.  Kommunikation mit Automaten , 1962 .

[25]  Wang Yi,et al.  Timed Automata Patterns , 2008, IEEE Transactions on Software Engineering.

[26]  Wojciech Penczek,et al.  Advances in Verification of Time Petri Nets and Timed Automata: A Temporal Logic Approach , 2006, Studies in Computational Intelligence.

[27]  Parosh Aziz Abdulla,et al.  Dense-Timed Petri Nets: Checking Zenoness, Token liveness and Boundedness , 2006, Log. Methods Comput. Sci..

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

[29]  Rajeev Alur,et al.  Model-Checking in Dense Real-time , 1993, Inf. Comput..

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

[31]  David de Frutos-Escrig,et al.  On non-decidability of reachability for timed-arc Petri nets , 1999, PNPM.