Skip to main content
SpringerLink
Log in

A Framework for Relating Timed Transition Systems and Preserving TCTL Model Checking

  • Conference paper
Computer Performance Engineering (EPEW 2010)

Part of the book series: Lecture Notes in Computer Science ((LNPSE,volume 6342))

Included in the following conference series:

Abstract

Many formal translations between time dependent models have been proposed over the years. While some of them produce timed bisimilar models, others preserve only reachability or (weak) trace equivalence. We suggest a general framework for arguing when a translation preserves Timed Computation Tree Logic (TCTL) or its safety fragment. The framework works at the level of timed transition systems, making it independent of the modeling formalisms and applicable to many of the translations published in the literature. Finally, we present a novel translation from extended Timed-Arc Petri Nets to Networks of Timed Automata and using the framework argue that it preserves the full TCTL. The translation has been implemented in the verification tool TAPAAL.

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

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. Alur, R., Dill, D.L.: A Theory of Timed Automata. Theoretical Computer Science 126(2), 183–235 (1994)

    Google Scholar 

  2. Archer, M., HongPing, L., Lynch, N., Mitra, S., Umeno, S.: Specifying and proving properties of timed I/O automata in the TIOA toolkit. In: Proc. of MEMOCODE 2006, pp. 129–138 (2006)

    Google Scholar 

  3. Behrmann, G., David, A., Larsen, K.G.: A tutorial on uppaal. In: Bernardo, M., Corradini, F. (eds.) SFM-RT 2004. LNCS, vol. 3185, pp. 200–236. Springer, Heidelberg (2004)

    Chapter  Google Scholar 

  4. Bérard, B., Cassez, F., Haddad, S., Lime, D., Roux, O.H.: Comparison of the expressiveness of timed automata and time Petri nets. In: Pettersson, P., Yi, W. (eds.) FORMATS 2005. LNCS, vol. 3829, pp. 211–225. Springer, Heidelberg (2005)

    Chapter  Google Scholar 

  5. Berthomieu, B., Peres, F., Vernadat, F.: Bridging the gap between timed automata and bounded time Petri nets. In: Asarin, E., Bouyer, P. (eds.) FORMATS 2006. LNCS, vol. 4202, pp. 82–97. Springer, Heidelberg (2006)

    Chapter  Google Scholar 

  6. Bolognesi, T., Lucidi, F., Trigila, S.: From timed Petri nets to timed LOTOS. In: Proc. of PSTV 1990, pp. 395–408 (1990)

    Google Scholar 

  7. Boucheneb, H., Gardey, G., Roux, O.H.: TCTL model checking of time Petri nets. Journal of Logic and Computation 19(6), 1509–1540 (2009)

    Article  MathSciNet  MATH  Google Scholar 

  8. Bouyer, P., Haddad, S., Reynier, P.A.: Timed Petri nets and timed automata: On the discriminating power of Zeno sequences. Information and Computation 206(1), 73–107 (2008)

    Article  MathSciNet  MATH  Google Scholar 

  9. Byg, J., Joergensen, K.Y., Srba, J.: An efficient translation of timed-arc Petri nets to networks of timed automata. In: Breitman, K., Cavalcanti, A. (eds.) ICFEM 2009. LNCS, vol. 5885, pp. 698–716. Springer, Heidelberg (2009)

    Google Scholar 

  10. Cassez, F., Roux, O.H.: Structural translation from time Petri nets to timed automata. ENTCS 128(6), 145–160 (2005); Proc. of AVoCS 2004

    Google Scholar 

  11. Dong, J.S., Hao, P., Qin, S., Sun, J., Yi, W.: Timed Automata Patterns. IEEE Transactions on Software Engingeering 34(6), 844–859 (2008)

    Article  Google Scholar 

  12. Gardey, G., Lime, D., Magnin, M., Roux, O.H.: Romeo: A tool for analyzing time Petri nets. In: Etessami, K., Rajamani, S.K. (eds.) CAV 2005. LNCS, vol. 3576, pp. 418–423. Springer, Heidelberg (2005)

    Chapter  Google Scholar 

  13. Jacobsen, L., Jacobsen, M., Möller, M.H., Srba, J.: A framework for relating timed transition systems and preserving TCTL model checking. Technical Report FIMU-RS-2010-09, Faculty of Informatics, Masaryk Univ. (2010)

    Google Scholar 

  14. Janowska, A., Janowski, P., Wróblewski, D.: Translation of Intermediate Language to Timed Automata with Discrete Data. Fundamenta Informaticae 85(1-4), 235–248 (2008)

    MathSciNet  MATH  Google Scholar 

  15. Merlin, P.M.: A Study of the Recoverability of Computing Systems. PhD thesis, University of California, Irvine (1974)

    Google Scholar 

  16. Penczek, W., Pólrola, A.: Advances in Verification of Time Petri Nets and Timed Automata: A Temporal Logic Approach. SCI, vol. 20. Springer, Heidelberg (2006)

    MATH  Google Scholar 

  17. 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)

    Chapter  Google Scholar 

  18. Srba, J.: Timed-arc Petri nets vs. networks of timed automata. In: Ciardo, G., Darondeau, P. (eds.) ICATPN 2005. LNCS, vol. 3536, pp. 385–402. Springer, Heidelberg (2005)

    Chapter  Google Scholar 

  19. Srba, J.: Comparing the expressiveness of timed automata and timed extensions of Petri nets. In: Cassez, F., Jard, C. (eds.) FORMATS 2008. LNCS, vol. 5215, pp. 15–32. Springer, Heidelberg (2008)

    Chapter  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science, Aalborg University, Selma Lagerlöfs Vej 300, DK-9220, Aalborg East, Denmark

    Lasse Jacobsen, Morten Jacobsen, Mikael H. Møller & Jiří Srba

Authors
  1. Lasse Jacobsen
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Morten Jacobsen
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Mikael H. Møller
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Jiří Srba
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Dipartimento di Matematica, Fisica e Chimica, Università di Urbino “Carlo Bo”, Piazza della Repubblica 13, 61029, Urbino, Italy

    Alessandro Aldini  & Marco Bernardo  & 

  2. Dipartimento di Scienze dell’Informazione, Universit di Bologna, Mura Anteo Zamboni 7, 40126, Bologna, Italy

    Luciano Bononi

  3. Dipartimento di Informatica, Universit dell’Aquila, Via Vetoio, Coppito, 67100, L’Aquila, Italy

    Vittorio Cortellessa

Rights and permissions

Reprints and permissions

Copyright information

© 2010 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Jacobsen, L., Jacobsen, M., Møller, M.H., Srba, J. (2010). A Framework for Relating Timed Transition Systems and Preserving TCTL Model Checking. In: Aldini, A., Bernardo, M., Bononi, L., Cortellessa, V. (eds) Computer Performance Engineering. EPEW 2010. Lecture Notes in Computer Science, vol 6342. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-15784-4_6

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-15784-4_6

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-15783-7

  • Online ISBN: 978-3-642-15784-4

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation