Skip to main content

An Automatic Technique for Checking the Simulation of Timed Systems

  • Conference paper
Automated Technology for Verification and Analysis

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

Abstract

In this paper, we suggest an automatic technique for checking the timed weak simulation between timed transition systems. The technique is an observation-based method in which two timed transition systems are composed with a timed observer. A μ-calculus property that captures the timed weak simulation is then verified on the result of the composition. An interesting feature of the suggested technique is that it only relies on an untimed μ-calculus model-checker without any specific algorithm needed to analyze the result of the composition. We also show that our simulation relation supports interesting results concerning the trace inclusion and the preservation of linear properties. Finally, the technique is validated using the FIACRE/TINA toolset.

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

Access this chapter

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. http://ecdar.cs.aau.dk/

  2. http://www.irit.fr/~Elie.Fares/fiacre/refinement/

  3. http://www.irit.fr/~Jean-Paul.Bodeveix/COQ/Refinement/

  4. Alur, R., Dang, T., Ivančić, F.: Predicate abstraction for reachability analysis of hybrid systems. ACM Trans. Embed. Comput. Syst. 5(1), 152–199 (2006)

    Article  Google Scholar 

  5. Alur, R., Dill, D.L.: A theory of timed automata. Theor. Comput. Sci. 126(2), 183–235 (1994)

    Article  MathSciNet  Google Scholar 

  6. Alves, A., Arkin, A., Askary, S., Bloch, B., Curbera, F., Goland, Y., Kartha, N., Sterling, König, D., Mehta, V., Thatte, S., van der Rijn, D., Yendluri, P., Yiu, A.: Web Services Business Process Execution Language Version 2.0. OASIS (May 2006)

    Google Scholar 

  7. Berthomieu, F.V.B., Ribet, P.-O.: The tool tina – construction of abstract state spaces for petri nets and time petri nets. International Journal of Production Research 42 (2004)

    Google Scholar 

  8. Baier, C., Katoen, J.-P.: Principles of Model Checking (Representation and Mind Series). The MIT Press (2008)

    Google Scholar 

  9. Bérard, B., Cassez, F., Haddad, S., Lime, D., Roux, O.H.: Comparison of different semantics for time Petri nets. In: Peled, D.A., Tsay, Y.-K. (eds.) ATVA 2005. LNCS, vol. 3707, pp. 293–307. Springer, Heidelberg (2005)

    Chapter  Google Scholar 

  10. Berthomieu, B., Bodeveix, J.-P., Farail, P., Filali, M., Garavel, H., Gaufillet, P., Lang, F., Vernadat, F.: Fiacre: An Intermediate Language for Model Verification in the Topcased Environment. In: ERTS 2008, Toulouse, France (2008)

    Google Scholar 

  11. Bradfield, J., Stirling, C.: Modal mu-calculi. In: Handbook of Modal Logic, pp. 721–756. Elsevier (2007)

    Chapter  Google Scholar 

  12. Bulychev, P., Chatain, T., David, A., Larsen, K.G.: Efficient on-the-fly algorithm for checking alternating timed simulation. In: Ouaknine, J., Vaandrager, F.W. (eds.) FORMATS 2009. LNCS, vol. 5813, pp. 73–87. Springer, Heidelberg (2009)

    Chapter  Google Scholar 

  13. Clarke, E.M., Grumberg, O., Long, D.E.: Model checking and abstraction. ACM Trans. Program. Lang. Syst. 16(5), 1512–1542 (1994)

    Article  Google Scholar 

  14. David, A., Larsen, K.G., Legay, A., Nyman, U., Wąsowski, A.: Methodologies for specification of real-time systems using timed I/O automata. In: de Boer, F.S., Bonsangue, M.M., Hallerstede, S., Leuschel, M. (eds.) FMCO 2009. LNCS, vol. 6286, pp. 290–310. Springer, Heidelberg (2010)

    Chapter  Google Scholar 

  15. David, A., Larsen, K.G., Legay, A., Nyman, U., Wasowski, A.: Timed I/O automata: a complete specification theory for real-time systems. In: Proc. of HSCC 2010, pp. 91–100. ACM, New York (2010)

    Google Scholar 

  16. Dierks, H., Kupferschmid, S., Larsen, K.G.: Automatic abstraction refinement for timed automata. In: Raskin, J.-F., Thiagarajan, P.S. (eds.) FORMATS 2007. LNCS, vol. 4763, pp. 114–129. Springer, Heidelberg (2007)

    Chapter  Google Scholar 

  17. Emerson, E.A.: Model checking and the mu-calculus. DIMACS Series in Discrete Mathematics American Mathematical Society, pp. 185–214. American Mathematical Society (1997)

    Chapter  Google Scholar 

  18. Fares, E., Bodeveix, J.-P., Filali, M.: An automatic technique for checking the simulation of timed systems. Technical Report IRIT/RT–2013-10–FR (January 2013), http://www.irit.fr/~Elie.Fares/PUBLICATIONS/RTIRIT--2013-10--FR.pdf

  19. Griffault, A., Vincent, A.: The mec 5 model-checker. In: Alur, R., Peled, D.A. (eds.) CAV 2004. LNCS, vol. 3114, pp. 488–491. Springer, Heidelberg (2004)

    Chapter  Google Scholar 

  20. Henzinger, T., Manna, Z., Pnueli, A.: Timed transition systems. In: de Bakker, J., Huizing, C., de Roever, W., Rozenberg, G. (eds.) REX 1991. LNCS, vol. 600, pp. 226–251. Springer, Heidelberg (1992)

    Chapter  Google Scholar 

  21. Jeffrey, A.S., Schneider, S.A., Vaandrager, F.W.: A comparison of additivity axioms in timed transition systems. Technical report, Amsterdam, The Netherlands, The Netherlands (1993)

    Google Scholar 

  22. Jensen, H.E., Guldstr, K., Skou, A.: Scaling up uppaal: Automatic verification of real-time systems using compositionality and abstraction. In: Joseph, M. (ed.) FTRTFT 2000. LNCS, vol. 1926, pp. 19–30. Springer, Heidelberg (2000)

    Chapter  Google Scholar 

  23. Kaynar, D.K., Lynch, N., Segala, R., Vaandrager, F.: The Theory of Timed I/O Automata (Synthesis Lectures in Computer Science) (2006)

    Article  Google Scholar 

  24. Larsen, K.G., Pettersson, P., Yi, W.: Uppaal in a nutshell. Int. Journal on Software Tools for Technology Transfer 1, 134–152 (1997)

    Article  Google Scholar 

  25. Lynch, N., Vandraager, F.: Forward and backward simulations - part ii: Timing-based systems. Information and Computation 128 (1995)

    Google Scholar 

  26. Nicollin, X., Sifakis, J.: An overview and synthesis on timed process algebras. In: Huizing, C., de Bakker, J.W., Rozenberg, G., de Roever, W.-P. (eds.) REX 1991. LNCS, vol. 600, pp. 526–548. Springer, Heidelberg (1992)

    Chapter  Google Scholar 

  27. Ouaknine, J., Worrell, J.: On the language inclusion problem for timed automata: Closing a decidability gap. In: LICS, pp. 54–63. IEEE Computer Society (2004)

    Google Scholar 

  28. Schneider, S.: Concurrent and Real Time Systems: The CSP Approach, 1st edn. John Wiley & Sons, Inc., New York (1999)

    Google Scholar 

  29. Tasiran, S., Alur, R., Kurshan, R.P., Brayton, R.K.: Verifying abstractions of timed systems. In: Sassone, V., Montanari, U. (eds.) CONCUR 1996. LNCS, vol. 1119, pp. 546–562. Springer, Heidelberg (1996)

    Chapter  Google Scholar 

  30. C. D. Team. The Coq proof assistant reference manual, version 8.2 (August. 2009)

    Google Scholar 

  31. van Glabbeek, R.J.: The linear time-branching time spectrum (extended abstract). In: Baeten, J.C.M., Klop, J.W. (eds.) CONCUR 1990. LNCS, vol. 458, pp. 278–297. Springer, Heidelberg (1990)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2013 Springer International Publishing Switzerland

About this paper

Cite this paper

Fares, E., Bodeveix, JP., Filali-Amine, M., Garnacho, M. (2013). An Automatic Technique for Checking the Simulation of Timed Systems. In: Van Hung, D., Ogawa, M. (eds) Automated Technology for Verification and Analysis. Lecture Notes in Computer Science, vol 8172. Springer, Cham. https://doi.org/10.1007/978-3-319-02444-8_7

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-02444-8_7

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-02443-1

  • Online ISBN: 978-3-319-02444-8

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics