Article

Timed-arc petri nets vs. networks of timed automata

Author:

Jiří SrbaAuthors Info & Claims

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

Pages 385 - 402

https://doi.org/10.1007/11494744_22

Published: 20 June 2005 Publication History

Abstract

We establish mutual translations between the classes of 1-safe timed-arc Petri nets (and its extension with testing arcs) and networks of timed automata (and its subclass where every clock used in the guard has to be reset). The presented translations are very tight (up to isomorphism of labelled transition systems with time). This provides a convenient characterization from the theoretical point of view but is not always satisfactory from the practical point of view because of the possible non-polynomial blow up in the size (in the direction from automata to nets). Hence we relax the isomorphism requirement and provide efficient (polynomial time) reductions between networks of timed automata and 1-safe timed-arc Petri nets preserving the answer to the reachability question. This makes our techniques suitable for automatic translation into a format required by tools like UPPAAL and KRONOS. A direct corollary of the presented reductions is a new PSPACE-completeness result for reachability in 1-safe timed-arc Petri nets, reusing the region/zone techniques already developed for timed automata.

References

[1]

P.A. Abdulla and A. Nyln. Timed Petri nets and BQOs. In Proc. of the 22nd International Conference on Application and Theory of Petri Nets (ICATPN'01), volume 2075 of LNCS, pages 53-70. Springer-Verlag, 2001.

Digital Library

[2]

L. Aceto and F. Laroussinie. Is your model checker on time? On the complexity of model checking for timed modal logics. Journal of Logic and Algebraic Programming, 52-53:7-51, 2002.

[3]

R. Alur and D. Dill. A theory of timed automata. Theoretical Computer Science, 126(2):183-235, 1994.

Digital Library

[4]

A. Arnold. Finite Transition Systems. Prentice-Hall, 1994.

Digital Library

[5]

B. Berard, A. Petit, V. Diekert, and P. Gastin. Characterization of the expressive power of silent transitions in timed automata. Fundamenta Informaticae, 36(2- 3):145-182, 1998.

Digital Library

[6]

B. Berthomieu, P-O. Ribet, and F. Vernadat. The tool tina - construction of abstract state spaces for petri nets and time petri nets. International Journal of Production Research, 2004. To appear.

[7]

T. Bolognesi, F. Lucidi, and S. Trigila. From timed Petri nets to timed LOTOS. In Proc. of the IFIP WG 6.1 Tenth International Symposium on Protocol Specification, Testing and Verification (Ottawa 1990), pages 1-14. 1990.

Digital Library

[8]

S. Bornot, J. Sifakis, and S. Tripakis. Modeling urgency in timed systems. In International Symposium: Compositionality - The Significant Difference, Malente (Holstein, Germany), volume 1536 of LNCS, 1998.

Digital Library

[9]

P. Bouyer. Untameable timed automata! In Proc. of the 20th Annual Symposium on Theoretical Aspects of Computer Science (STACS'03), volume 2607 of LNCS, pages 620-631. Springer-Verlag, 2003.

Digital Library

[10]

Fred D.J. Bowden. Modelling time in Petri nets. In Proc. of the Second Australia-Japan Workshop on Stochastic Models, 1996. http://www.itr.unisa.edu.au/~fbowden/pprs/stomod96/.

[11]

M. Boyer and M. Diaz. Non equivalence between time Petri nets and time stream Petri nets. In Proc. of the 8th International Workshop on Petri Nets and Performance Models (PNPM'99), pages 198-207. IEEE Computer Society, 1999.

Digital Library

[12]

M. Bozga, C. Daws, O. Maler, A. Olivero, S. Tripakis, and S. Yovine. Kronos: A model-checking tool for real-time systems. In Proc. of the 10th International Conference on Computer-Aided Verification (CAV'98), volume 1427 of LNCS, pages 546-550. Springer-Verlag, 1998.

Digital Library

[13]

N. Busi and G.M. Pinna. Process semantics for place/transition nets with inhibitor and read arcs. Fundamenta Informaticae, 40(2-3):165-197, 1999.

Digital Library

[14]

F. Cassez and O.H. Roux. Structural translation of time petri nets into timed automata. In Workshop on Automated Verification of Critical Systems (AVoCS'04), ENTCS. Elsevier, 2004.

[15]

A. Cheng, J. Esparza, and J. Palsberg. Complexity results for 1-safe nets. Theoretical Computer Science, 147(1-2):117-136, 1995.

Digital Library

[16]

S. Haar, F. Simonot-Lion, L. Kaiser, and J. Toussaint. Equivalence of timed state machines and safe time Petri nets. In Proc. of the 6th International Workshop on Discrete Event Systems (WODES'02), pages 119-126, 2002.

Digital Library

[17]

H.M. Hanisch. Analysis of place/transition nets with timed-arcs and its application to batch process control. In Proc. of the 14th International Conference on Application and Theory of Petri Nets (ICATPN'93), volume 691 of LNCS, pages 282-299, 1993.

Digital Library

[18]

D. Kozen. Lower bounds for natural proof systems. In Proc. of the 18th Annual Symposium on Foundations of Computer Science, pages 254-266. IEEE, 1977.

Digital Library

[19]

F. Laroussinie and K.G. Larsen. CMC: A tool for compositional model-checking of real-time systems. In Proc. of the FIP TC6 WG6.1 Joint International Conference on Formal Description Techniques for Distributed Systems and Communication Protocols (FORTE XI) and Protocol Specification, Testing and Verification (PSTV XVIII), pages 439-456. Kluwer, B.V., 1998.

Digital Library

[20]

F. Laroussinie, N. Markey, and Ph. Schnoebelen. On model checking durational Kripke structures. In Proc. of the 5th International Conference on Foundations of Software Science and Computation Structures (FOSSACS'02), volume 2303 of LNCS, pages 264-279. Springer-Verlag, 2002.

Digital Library

[21]

K.G. Larsen, P. Pettersson, and W. Yi. Uppaal in a Nutshell. International Journal on Software Tools for Technology Transfer, 1(1-2):134-152, 1997.

Digital Library

[22]

D. Lime and O.H. Roux. State class timed automaton of a time Petri net. In Proc. of the 10th International Workshop on Petri Net and Performance Models (PNPM'03), pages 124-133, 2003.

[23]

M. Nielsen, V. Sassone, and J. Srba. Properties of distributed timed-arc Petri nets. In Proc. of the 21st International Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS'01), volume 2245 of LNCS, pages 280-291. Springer-Verlag, 2001.

Digital Library

[24]

O. Roux, D. Lime, and G. Gardey. software studio for time Petri net analysis. http://www.irccyn.ec-nantes.fr/irccyn/d/en/equipes/TempsReel/logs /software-2-romeo.

[25]

V. Valero Ruiz, D. de Frutos Escrig, and O. Marroquin Alonso. Decidability of properties of timed-arc Petri nets. In Proc. of the 21st International Conference on Application and Theory of Petri Nets (ICATPN'00), volume 1825 of LNCS, pages 187-206. Springer-Verlag, 2000.

Digital Library

[26]

V. Valero Ruiz, F. Cuartero Gomez, and D. de Frutos Escrig. On nondecidability of reachability for timed-arc Petri nets. In Proc. of the 8th International Workshop on Petri Net and Performance Models (PNPM'99), pages 188-196, 1999.

Digital Library

[27]

J. Sifakis and S. Yovine. Compositional specification of timed systems. In Proc. of the 13th Annual Symposim on Theoretical Aspects of Computer Science (STACS'96), volume 1046 of LNCS, pages 347-359. Springer-Verlag, 1996.

Digital Library

[28]

W. Vogler. Partial order semantics and read arcs. Theoretical Computer Science, 286(1):33-63, 2002.

Digital Library

[29]

J. Wang. Timed Petri Nets, Theory and Application. Kluwer Academic Publishers, 1998.

Cited By

Jacobsen LJacobsen MMøller MSrba J(2011)Verification of timed-arc Petri netsProceedings of the 37th international conference on Current trends in theory and practice of computer science10.5555/1946370.1946374(46-72)Online publication date: 22-Jan-2011
https://dl.acm.org/doi/10.5555/1946370.1946374
Jacobsen LJacobsen MMøller MSrba J(2010)A framework for relating timed transition systems and preserving TCTL model checkingProceedings of the 7th European performance engineering conference on Computer performance engineering10.5555/1926981.1926990(83-98)Online publication date: 23-Sep-2010
https://dl.acm.org/doi/10.5555/1926981.1926990
Boyer MRoux O(2008)On the Compared Expressiveness of Arc, Place and Transition Time Petri NetsFundamenta Informaticae10.5555/2366267.236626988:3(225-249)Online publication date: 1-Aug-2008
https://dl.acm.org/doi/10.5555/2366267.2366269
Show More Cited By

Index Terms

Timed-arc petri nets vs. networks of timed automata
1. Theory of computation
  1. Formal languages and automata theory
  2. Models of computation

Index terms have been assigned to the content through auto-classification.

Recommendations

Timed Petri nets and timed automata: On the discriminating power of zeno sequences

Timed Petri nets and timed automata are two standard models for the analysis of real-time systems. We study in this paper their relationship, and prove in particular that they are incomparable with respect to language equivalence. In fact, we study the ...
Timed petri nets and timed automata: on the discriminating power of zeno sequences
ICALP'06: Proceedings of the 33rd international conference on Automata, Languages and Programming - Volume Part II

Timed Petri nets and timed automata are two standard models for the analysis of real-time systems. In this paper, we prove that they are incomparable for the timed language equivalence. Thus we propose an extension of timed Petri nets with read-arcs (RA-...
An Efficient Translation of Timed-Arc Petri Nets to Networks of Timed Automata
ICFEM '09: Proceedings of the 11th International Conference on Formal Engineering Methods: Formal Methods and Software Engineering

Bounded timed-arc Petri nets with read-arcs were recently proven equivalent to networks of timed automata, though the Petri net model cannot express urgent behaviour and the described mutual translations are rather inefficient. We propose an extension ...

Comments

Information & Contributors

Information

Published In

cover image Guide Proceedings

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

June 2005

475 pages

ISBN:3540263012

Editors:
Gianfranco Ciardo
UC Riverside
,
Philippe Darondeau
IRISA, CNRS & INRIA, Rennes, France

Publisher

Springer-Verlag

Berlin, Heidelberg

Publication History

Published: 20 June 2005

Qualifiers

Article

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

6
Total Citations
View Citations
0
Total Downloads

Downloads (Last 12 months)0
Downloads (Last 6 weeks)0

Reflects downloads up to 03 Sep 2024

Other Metrics

View Author Metrics

Citations

Cited By

Jacobsen LJacobsen MMøller MSrba J(2011)Verification of timed-arc Petri netsProceedings of the 37th international conference on Current trends in theory and practice of computer science10.5555/1946370.1946374(46-72)Online publication date: 22-Jan-2011
https://dl.acm.org/doi/10.5555/1946370.1946374
Jacobsen LJacobsen MMøller MSrba J(2010)A framework for relating timed transition systems and preserving TCTL model checkingProceedings of the 7th European performance engineering conference on Computer performance engineering10.5555/1926981.1926990(83-98)Online publication date: 23-Sep-2010
https://dl.acm.org/doi/10.5555/1926981.1926990
Boyer MRoux O(2008)On the Compared Expressiveness of Arc, Place and Transition Time Petri NetsFundamenta Informaticae10.5555/2366267.236626988:3(225-249)Online publication date: 1-Aug-2008
https://dl.acm.org/doi/10.5555/2366267.2366269
Boyer MRoux O(2008)On the Compared Expressiveness of Arc, Place and Transition Time Petri NetsFundamenta Informaticae10.5555/1497079.149708188:3(225-249)Online publication date: 1-Aug-2008
https://dl.acm.org/doi/10.5555/1497079.1497081
Boyer MRoux O(2007)Comparison of the expressiveness of arc, place and transition time Petri netsProceedings of the 28th international conference on Applications and theory of Petri nets and other models of concurrency10.5555/1769053.1769062(63-82)Online publication date: 25-Jun-2007
https://dl.acm.org/doi/10.5555/1769053.1769062
Bouyer PHaddad SReynier P(2006)Timed petri nets and timed automataProceedings of the 33rd international conference on Automata, Languages and Programming - Volume Part II10.1007/11787006_36(420-431)Online publication date: 10-Jul-2006
https://dl.acm.org/doi/10.1007/11787006_36

View Options

View options

Media

Figures

Other

Tables

View Table of Contents