Skip to main content
SpringerLink
Log in

Timed-Arc Petri Nets vs. Networks of Timed Automata

  • Conference paper
Applications and Theory of Petri Nets 2005 (ICATPN 2005)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 3536))

Included in the following conference series:

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.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Abdulla, P.A., Nylén, A.: Timed Petri nets and BQOs. In: Colom, J.-M., Koutny, M. (eds.) ICATPN 2001. LNCS, vol. 2075, pp. 53–70. Springer, Heidelberg (2001)

    Chapter  Google Scholar 

  2. Aceto, L., Laroussinie, F.: 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)

    Article  MathSciNet  Google Scholar 

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

    Article  MATH  MathSciNet  Google Scholar 

  4. Arnold, A.: Finite Transition Systems. Prentice-Hall, Englewood Cliffs (1994)

    MATH  Google Scholar 

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

    MATH  MathSciNet  Google Scholar 

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

    Google Scholar 

  7. Bolognesi, T., Lucidi, F., Trigila, S.: 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), pp. 1–14 (1990)

    Google Scholar 

  8. Bornot, S., Sifakis, J., Tripakis, S.: Modeling urgency in timed systems. In: de Roever, W.-P., Langmaack, H., Pnueli, A. (eds.) COMPOS 1997. LNCS, vol. 1536, p. 103. Springer, Heidelberg (1998)

    Chapter  Google Scholar 

  9. Bouyer, P.: Untameable timed automata! In: Alt, H., Habib, M. (eds.) STACS 2003. LNCS, vol. 2607, pp. 620–631. Springer, Heidelberg (2003)

    Chapter  Google Scholar 

  10. Bowden, F.D.J.: 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. Boyer, M., Diaz, M.: 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 1999), pp. 198–207. IEEE Computer Society, Los Alamitos (1999)

    Chapter  Google Scholar 

  12. Bozga, M., Daws, C., Maler, O., Olivero, A., Tripakis, S., Yovine, S.: Kronos: A model-checking tool for real-time systems. In: Y. Vardi, M. (ed.) CAV 1998. LNCS, vol. 1427, pp. 546–550. Springer, Heidelberg (1998)

    Chapter  Google Scholar 

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

    MATH  MathSciNet  Google Scholar 

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

    Google Scholar 

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

    Article  MATH  MathSciNet  Google Scholar 

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

    Google Scholar 

  17. Hanisch, H.M.: Analysis of place/transition nets with timed-arcs and its application to batch process control. In: Ajmone Marsan, M. (ed.) ICATPN 1993. LNCS, vol. 691, pp. 282–299. Springer, Heidelberg (1993)

    Google Scholar 

  18. Kozen, D.: Lower bounds for natural proof systems. In: Proc. of the 18th Annual Symposium on Foundations of Computer Science, pp. 254–266. IEEE, Los Alamitos (1977)

    Google Scholar 

  19. Laroussinie, F., Larsen, K.G.: 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), pp. 439–456. Kluwer, Dordrecht (1998)

    Google Scholar 

  20. Laroussinie, F., Markey, N., Schnoebelen, P.: On model checking durational Kripke structures. In: Nielsen, M., Engberg, U. (eds.) FOSSACS 2002. LNCS, vol. 2303, pp. 264–279. Springer, Heidelberg (2002)

    Chapter  Google Scholar 

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

    MATH  Google Scholar 

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

    Google Scholar 

  23. Nielsen, M., Sassone, V., Srba, J.: Properties of distributed timed-arc Petri nets. In: Hariharan, R., Mukund, M., Vinay, V. (eds.) FSTTCS 2001. LNCS, vol. 2245, pp. 280–291. Springer, Heidelberg (2001)

    Chapter  Google Scholar 

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

  25. Valero Ruiz, V., de Frutos Escrig, D., Marroquin Alonso, O.: Decidability of properties of timed-arc Petri nets. In: Nielsen, M., Simpson, D. (eds.) ICATPN 2000. LNCS, vol. 1825, pp. 187–206. Springer, Heidelberg (2000)

    Chapter  Google Scholar 

  26. Valero Ruiz, V., Cuartero Gomez, F., de Frutos Escrig, D.: On non-decidability of reachability for timed-arc Petri nets. In: Proc. of the 8th International Workshop on Petri Net and Performance Models (PNPM 1999), pp. 188–196 (1999)

    Google Scholar 

  27. Sifakis, J., Yovine, S.: Compositional specification of timed systems. In: Puech, C., Reischuk, R. (eds.) STACS 1996. LNCS, vol. 1046, pp. 347–359. Springer, Heidelberg (1996)

    Google Scholar 

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

    Article  MATH  MathSciNet  Google Scholar 

  29. Wang, J.: Timed Petri Nets, Theory and Application. Kluwer Academic Publishers, Dordrecht (1998)

    MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. BRICS Department of Computer Science, Aalborg University, Fredrik Bajersvej 7B, 9220, Aalborg East, Denmark

    Jiří Srba

Authors
  1. Jiří Srba
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. UC Riverside,  

    Gianfranco Ciardo

  2. IRISA, CNRS & INRIA, Rennes, France

    Philippe Darondeau

Rights and permissions

Reprints and permissions

Copyright information

© 2005 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Srba, J. (2005). Timed-Arc Petri Nets vs. Networks of Timed Automata. In: Ciardo, G., Darondeau, P. (eds) Applications and Theory of Petri Nets 2005. ICATPN 2005. Lecture Notes in Computer Science, vol 3536. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11494744_22

Download citation

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

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-26301-2

  • Online ISBN: 978-3-540-31559-9

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation