Advertisement

Real-time specifications

  • Alexandre David
  • Kim G. Larsen
  • Axel Legay
  • Ulrik Nyman
  • Louis-Marie Traonouez
  • Andrzej Wąsowski
Regular Paper

Abstract

A specification theory combines notions of specifications and implementations with a satisfaction relation, a refinement relation, and a set of operators supporting stepwise design. We develop a specification framework for real-time systems using Timed I/O Automata as the specification formalism, with the semantics expressed in terms of Timed I/O Transition Systems. We provide constructs for refinement, consistency checking, logical and structural composition, and quotient of specifications—all indispensable ingredients of a compositional design methodology. The theory is implemented in the new tool Ecdar. We present symbolic versions of the algorithms used in Ecdar, and demonstrate the use of the tool using a small case study in compositional verification.

Keywords

Real-time systems Stepwise-refinement Compositional verification Timed I/O automata 

Notes

Acknowledgments

This work was partially supported by VKR Centre of Excellence–MT-LAB, the European project COMBEST, and ARC (TP)I.

References

  1. 1.
    Abdellatif, T., Combaz, J., Sifakis, J.: Model-based implementation of real-time applications. In: EMSOFT, pp. 229–238. ACM, New York (2010)Google Scholar
  2. 2.
    Adler, B.T, de Alfaro, L., Dias, L., de Silva, F.M., Legay, A., Raman, V., Ticc, P.R.: A tool for interface compatibility and composition. In: CAV, vol. 4144 of LNCS, pp. 59–62. Springer, Berlin (2006)Google Scholar
  3. 3.
    Alur, R., Dill, D.L.: A theory of timed automata. Theor. Comput. Sci. 126(2), 183–235 (1994)CrossRefzbMATHMathSciNetGoogle Scholar
  4. 4.
    Alur, R., Henzinger, T.A., Kupferman, O., Vardi, M.Y.: Alternating refinement relations. In: CONCUR, vol. 1466 of LNCS. Springer, Berlin (1998)Google Scholar
  5. 5.
    Amnell, T., Fersman, E., Mokrushin, L., Pettersson, P., Times, W.Y.: A tool for schedulability analysis and code generation of real-time systems. In: FORMATS, vol. 2791 of LNCS, pp. 60–72. Springer, Berlin (2003)Google Scholar
  6. 6.
    Antonik, A., Huth, M., Larsen, K.G., Nyman, U., Wasowsk, A.: Modal and mixed specifications: key decision problems and their complexities. Math Struct Comput Sci 20(1), 75–103 (2010)CrossRefzbMATHGoogle Scholar
  7. 7.
    Baier, C., Katoen, J.-P.: Principles of Model Checking. The MIT Press, Cambridge (2008)Google Scholar
  8. 8.
    Bauer, S.S., Juhl, L., Larsen, K.G., Legay, A., Srba, J.: Extending modal transition systems with structured labels. Math Struct Comput Sci 22(4), 581–617 (2012)CrossRefzbMATHMathSciNetGoogle Scholar
  9. 9.
    Behrmann, G., Cougnard, A., David, A., Fleury, E., Larsen, K.G., Lime, D.: Uppaal-tiga: time for playing games! In: CAV, vol. 4590 of LNCS. Springer, Berlin (2007)Google Scholar
  10. 10.
    Behrmann, G., David, A., Larsen, K.G., Pettersson, P., Yi, W.: Developing uppaal over 15 years. Softw. Pract. Exper. 41(2), 133–142 (2011)Google Scholar
  11. 11.
    Berendsen, J., Vaandrager, F.W.: Compositional abstraction in real-time model checking. In: FORMATS, vol. 5215 of LNCS. Springer, Berlin (2008)Google Scholar
  12. 12.
    Bertrand, N., Legay, A., Pinchinat, S., Raclet, J.-B.: A compositional approach on modal specifications for timed systems. In ICFEM, LNCS. Springer, Berlin (2009)Google Scholar
  13. 13.
    Bourke, T., Sowmya, A.: Automatically transforming and relating uppaal models of embedded systems. In EMSOFT, pp. 59–68. ACM, New York (2008)Google Scholar
  14. 14.
    Bourke, T., David, A., Larsen, K.G., Legay, A., Lime, D., Nyman, U., Wasowski, A.: New results on timed specifications. In: WADT, vol. 7137 of LNCS, pp. 175–192. Springer, Berlin (2010)Google Scholar
  15. 15.
    Bulychev, P., Chatain, T., David, A., Larsen, K.G.: Efficient on-the-fly algorithm for checking alternating timed simulation. In: FORMATS, vol. 5813 of LNCS, pp. 73–87. Springer, Berlin (2009)Google Scholar
  16. 16.
    Caillaud, B., Delahaye, B., Larsen, K.G., Legay, A., Pedersen, M.L., Wąsowski, A.: Compositional design methodology with constraint Markov chains. In: QEST, pp. 123–132. IEEE Press, USA (2010)Google Scholar
  17. 17.
    Cassez, F., David, A., Fleury, E., Larsen, K.G., Lime, D.: Efficient on-the-fly algorithms for the analysis of timed games, In: CONCUR (2005)Google Scholar
  18. 18.
    Cassez, F., David, A., Larsen, K.G., Lime, D., Raskin, J.-F.: Timed control with observation based and stuttering invariant strategies. In: ATVA, vol. 4762 of LNCS, pp. 192–206. Springer, Berlin (2007)Google Scholar
  19. 19.
    Cerans, K., Godskesen, J.C., Larsen, K.G.: Timed modal specification—theory and tools. In: CAV, pp. 253–267. Springer, Berlin (1993)Google Scholar
  20. 20.
    Chakabarti, A., de Alfaro, L., Henzinger, T.A., Stoelinga, M.I.A.: Resource interfaces. In: Alur. R., Lee, I., (eds) EMSOFT 03: 3rd International Workshop on Embedded Software, LNCS. Springer, Berlin (2003)Google Scholar
  21. 21.
    Chakrabarti, A., de Alfaro, L., Henzinger, T.A., Mang, F.Y.C.: Synchronous and bidirectional component interfaces. In: CAV, vol. 2404 of LNCS, pp. 414–427 (2002)Google Scholar
  22. 22.
    Clarke, E.M., Orna, G.: Model Checking. The MIT Press, Cambridge (1999)Google Scholar
  23. 23.
    David, A., Larsen, K.G., Legay, A., Nyman, U., Wasowski, A.: Methodologies for specification of real-time systems using timed i/o automata. In: FMCO, vol. 6286 of LNCS, pp. 290–310. Springer, Berlin (2009)Google Scholar
  24. 24.
    David, A., Larsen, K.G., Legay, A., Nyman, U., Wasowski, A.: Timed i/o automata: a complete specification theory for real-time systems. In: HSCC, pp. 91–100. ACM, USA (2010)Google Scholar
  25. 25.
    David, A., Larsen, K.G., Legay, A., Møller, M.H., Nyman, U., Ravn, A.P., Skou, A., Wasowski, A.: Compositional verification of real-time systems using ecdar. STTT 14(6), 703–720 (2012)Google Scholar
  26. 26.
    David, A., Larsen, K.G., Legay, A., Nyman, U., Wasowski, A.: Ecdar: An environment for compositional design and analysis of real time systems. In: ATVA, vol. 6252 of LNCS, pp. 365–370. Springer, Berlin (2010)Google Scholar
  27. 27.
    de Alfaro, L.: Game models for open systems. In: Proceedings of the International Symposium on Verification (Theory in Practice), vol. 2772 of LNCS. Springer, Berlin (2003)Google Scholar
  28. 28.
    de Alfaro, L., da Silva, L.D., Faella, M., Legay, A., Roy, P., Sorea, Ma.: Sociable interfaces. In: FroCos, vol. 3717 of LNCS, pp. 81–105. Springer, Berlin (2005)Google Scholar
  29. 29.
    de Alfaro, L., Faella, M.: An accelerated algorithm for 3-color parity games with an application to timed games. In: CAV, vol. 4590 of LNCS. Springer, Berlin (2007)Google Scholar
  30. 30.
    de Alfaro, L, Faella, M., Henzinger, T.A., Majumdar, R., Stoelinga, M.: The element of surprise in timed games. In: CONCUR, vol. 2761 of LNCS, pp. 142–156. Springer, Berlin (2003)Google Scholar
  31. 31.
    de Alfaro, L., Henzinger, T.A.: Interface automata. In: FSE, pp. 109–120, Austria, September 2001. ACM Press, New York (2001)Google Scholar
  32. 32.
    de Alfaro, L., Henzinger, T.A.: Interfacebased design. In: In Engineering Theories of Software Intensive Systems, Marktoberdorf Summer School. Kluwer Academic Publishers, Dordrecht (2004)Google Scholar
  33. 33.
    de Alfaro, L., Henzinger, T.A., Majumdar, R.: Symbolic algorithms for infinite-state games. In: CONCUR, vol 2154 of LNCS, pp. 536–550. Springer, Berlin (2001)Google Scholar
  34. 34.
    de Alfaro, L., Henzinger, T.A., Stoelinga, M.I.A.: Timed interfaces. In: EMSOFT, vol. 2491 of LNCS, pp. 108–122. Springer, Berlin (2002)Google Scholar
  35. 35.
    Delahaye, B., Katoen, J.-P., Larsen, K.G., Legay, A., Pedersen, M.L., Sher, F., Wasowski, A.: Abstract probabilistic automata. In: VMCAI, pp. 324–339. Springer, Berlin (2011)Google Scholar
  36. 36.
    Fiadeiro, J., Andrade, L.F.: Interconnecting objects via contracts. In: Proceedings of the 38th International Conference on Technology of Object-Oriented Languages and Systems, Components for Mobile Computing (TOOLS’38), pp. 182–183. IEEE Computer Society, USA (2001)Google Scholar
  37. 37.
    Fiadeiro, J.L., Maibaum, T.S.E.: Interconnecting formalisms: Supporting modularity, reuse and incrementality. In: Proceedings of the 3rd ACM SIGSOFT Symposium on Foundations of Software Engineering (SIGSOFT FSE’95), pp. 72–80. ACM, New York (1995)Google Scholar
  38. 38.
    Garland, S.J., Lynch, N.A.: The IOA Language and Toolset: Support for Designing, Analyzing, and Building Distributed Systems. Technical report. Massachusetts Institute of Technology, Cambridge (1998)Google Scholar
  39. 39.
    Henzinger, T.A., Manna, Z., Pnueli, A.: Timed transition systems. In: REX Workshop, vol. 600 of LNCS, pp. 226–251. Springer, Berlin (1991)Google Scholar
  40. 40.
    Henzinger, T.A., Matic, S.: An interface algebra for real-time components. In: IEEE Real Time Technology and Applications Symposium, pp. 253–266. IEEE Computer Society, USA (2006)Google Scholar
  41. 41.
    Henzinger, T.A., Sifakis, J.: The embedded systems design challenge. In: FM, vol. 4085 of LNCS, pp. 1–15. Springer, Berlin (2006)Google Scholar
  42. 42.
    Kaynar, D.K., Lynch, N.A., Segala, R., Vaandrager, F.W.: The Theory of Timed I/O Automata, 2nd edn. Synthesis Lectures on Distributed Computing Theory. Morgan & Claypool Publishers, San Rafael (2010)Google Scholar
  43. 43.
    Kwiatkowska, M.Z., Norman, G., Sproston, J., Wang, F.: Symbolic model checking for probabilistic timed automata. In: FORMATS, vol. 3253 of LNCS, pp. 293–308. Springer, Berlin (2004)Google Scholar
  44. 44.
    Kwiatkowska, M.Z., Norman, G., Sproston, J., Wang, F.: Symbolic model checking for probabilistic timed automata. Inf. Comput. 205(7), 1027–1077 (2007)CrossRefzbMATHMathSciNetGoogle Scholar
  45. 45.
    Larsen, K.G.: Modal specifications. In: Sifakis, J., (ed) Automatic Verification Methods for Finite State Systems, vol. 407 of LNCS, pp. 232–246. Springer, Berlin (1989)Google Scholar
  46. 46.
    Larsen, K.G., Legay, A., Traonouez, L.-M., Wasowski, A.: Robust specification of real time components. In: FORMATS 2011, vol. 6919 of LNCS. Springer, Berlin (2011)Google Scholar
  47. 47.
    Larsen, K.G., Nyman, U., Wasowski, A.: Modal I/O automata for interface and product line theories. In: De Nicola, R., (ed) ESOP, vol. 4421 of LNCS, pp. 64–79. Springer, Berlin (2007)Google Scholar
  48. 48.
    Larsen, Kim G., Pettersson, Paul, Yi, Wang: Model-Checking for Real-Time Systems. In Proc. of Fundamentals of Computation Theory, volume 965 of LNCS, pages 62–88, August (1995)Google Scholar
  49. 49.
    Lynch, N.: I/O automata: a model for discrete event systems. In: Annual Conference on Information Sciences and Systems, pp. 29–38. Princeton University, Princeton (1988)Google Scholar
  50. 50.
    Lynch, N.A., Tuttle, M.R.: An introduction to input/output automata. Technical Report MIT/LCS/TM-373. The MIT Press, Cambridge (1988)Google Scholar
  51. 51.
    Maler, O., Pnueli, A., Sifakis, J.: On the synthesis of discrete controllers for timed systems (an extended abstract). In: STACS, pp. 229–242 (1995)Google Scholar
  52. 52.
    Robin, M.: Communication and Concurrency. Prentice Hall, New York (1988)Google Scholar
  53. 53.
    De Nicola, R., Segala, R.: A process algebraic view of input/output automata. Theor. Comput. Sci. 138(2), 391–423 (1995)Google Scholar
  54. 54.
    Post, A., Hoenicke, J., Podelski, A.: rt-inconsistency: a new property for real-time requirements. In: FASE, vol. 6603 of LNCS, pp. 34–49. Springer, Berlin (2011)Google Scholar
  55. 55.
    Raclet, J.-B., Caillaud, B., Nickovic, D., Passerone, R., Sangiovanni-Vincentelli, A., Henzinger, T., Larsen, K.G.: Contracts for the design of embedded systems part i: Methodology and use cases. Technical report. Submitted, http://www.irisa.fr/distribcom/benveniste/pub/ProcIEEE_contractsPart1.pdf
  56. 56.
    Stark, E.W., Cleavland, R., Smolka, S.A.: A process-algebraic language for probabilistic I/O automata. In: CONCUR, LNCS, pp. 189–2003. Springer, Berlin (2003)Google Scholar
  57. 57.
    Sun, J., Liu, Y., Dong, J.S.: Model checking csp revisited: Introducing a process analysis toolkit. In: ISoLA, vol. 17 of Communications in Computer and Information Science, pp. 307–322. Springer, Berlin (2008)Google Scholar
  58. 58.
    Sun, J., Liu, Y., Dong, J.S., Liu, Y., Shi, L., Étienne, A.: Modeling and verifying hierarchical real-time systems using stateful timed csp. ACM Trans. Softw. Eng. Methodol. 22(1), 3.1–3.29 (2013)Google Scholar
  59. 59.
    Tarski, A.: A lattice-theoretical fixpoint theorem and its applications. Pac. J. Math. 5, 285–309 (1955)CrossRefzbMATHMathSciNetGoogle Scholar
  60. 60.
    Traonouez, L.-M.: A parametric counterexample refinement approach for robust timed specifications. In: FIT, vol. 87 of EPTCS, pp. 17–33 (2012)Google Scholar
  61. 61.
    Vaandrager, F.W.: On the relationship between process algebra and input/output automata. In: LICS, pp. 387–398 (1991)Google Scholar
  62. 62.
    Wulf, M., Doyen, L., Markey, N., Raskin, J.-F.: Robust safety of timed automata. Formal Methods Syst. Design 33, 45–84 (2008) Google Scholar
  63. 63.
    Yi, W.: Real-time behaviour of asynchronous agents. In: Baeten, J.C.M., Klop, J.W., (eds) CONCUR, vol. 458 of LNCS, pp. 502–520. Springer, Berlin (1990)Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2013

Authors and Affiliations

  • Alexandre David
    • 1
  • Kim G. Larsen
    • 1
  • Axel Legay
    • 2
  • Ulrik Nyman
    • 1
  • Louis-Marie Traonouez
    • 2
  • Andrzej Wąsowski
    • 3
  1. 1.Computer ScienceAalborg UniversityAalborgDenmark
  2. 2.INRIA/IRISARennes CedexFrance
  3. 3.IT University of CopenhagenCopenhagenDenmark

Personalised recommendations