Skip to main content
SpringerLink
Log in

Semantics and pragmatics of Real-Time Maude

  • Published:
Higher-Order and Symbolic Computation

Abstract

At present, designers of real-time systems face a dilemma between expressiveness and automatic verification: if they can specify some aspects of their system in some automaton-based formalism, then automatic verification is possible; but more complex system components may be hard or impossible to express in such decidable formalisms. These more complex components may still be simulated; but there is then little support for their formal analysis. The main goal of Real-Time Maude is to provide a way out of this dilemma, while complementing both decision procedures and simulation tools. Real-Time Maude emphasizes ease and generality of specification, including support for distributed real-time object-based systems. Because of its generality, falling outside of decidable system classes, the formal analyses supported—including symbolic simulation, breadth-first search for failures of safety properties, and model checking of time-bounded temporal logic properties—are in general incomplete (although they are complete for discrete time). These analysis techniques have been shown useful in finding subtle bugs of complex systems, clearly outside the scope of current decision procedures. This paper describes both the semantics of Real-Time Maude specifications, and of the formal analyses supported by the tool. It also explains the tool's pragmatics, both in the use of its features, and in its application to concrete examples.

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

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. van der Aalst, W.M.P.: Interval timed coloured Petri nets and their analysis. In: Marsan M.A. (ed.) Application and Theory of Petri Nets 1993, vol. 691 of Lecture Notes in Computer Science, pp. 453–472. Springer (1993)

  2. Alur, R., Courcoubetis, C., Halbwachs, N., Henzinger, T.A., Ho, P.-H., Nicollin, X., Olivero, A., Sifakis, J., Yovine, S.: The algorithmic analysis of hybrid systems. Theor. Comput. Sci. 138, 3–34 (1995)

    Article  MATH  Google Scholar 

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

    Article  MathSciNet  Google Scholar 

  4. Alur, R., Henzinger, T.A.: Logics and models of real time: A survey. In: de Bakker, J.W., Huizing, K., de Roever, W.-P., Rozenberg, G. (eds.) Real Time: Theory in Practice, vol. 600 of Lecture Notes in Computer Science, pp. 74–106. Springer (1992)

  5. Behrmann, G., David, A., Larsen, K.G.: A tutorial on uppaal. In: Bernardo, M., Corradini, F. (eds.) Proc. Formal Methods for the Design of Real-Time Systems (SFM-RT 2004), vol. 3185 of Lecture Notes in Computer Science, pp. 200–236. Springer (2004) See also Uppaal home page at http://www.uppaal.com

  6. Bozga, M., Graf, S., Ober, I., Ober, I., Sifakis, J.: Tools and applications II: The IF toolset. In: Bernardo, M., Corradini, F. (eds.) Proc. Formal Methods for the Design of Real-Time Systems (SFM-RT 2004), vol. 3185 of Lecture Notes in Computer Science, pp. 237–267. Springer (2004)

  7. Bruni, R., Meseguer, J.: Generalized rewrite theories. In: Baeten, J.C.M., Lenstra, J.K., Parrow, J., Woeginger, G.J. (eds.) Proc. 30th International Colloquium on Automata, Languages and Programming (ICALP 2003), vol. 2719 of Lecture Notes in Computer Science, pp. 252–266. Springer (2003)

  8. Clarke, E., Grumberg, O., Peled, D.A.: Model Checking. MIT Press (1999)

  9. Clavel, M., Durán, F., Eker, S., Lincoln, P., Martí-Oliet, N., Meseguer, J., Quesada, J.F.: Maude: Specification and programming in rewriting logic. Theor. Comput. Sci. 285, 187–243 (2002)

    Article  MATH  Google Scholar 

  10. Clavel, M., Dúran, F., Eker, S., Lincoln, P., Martí-Oliet, N., Meseguer, J., Talcott, C.: Maude Manual (Version 2.1.1), April 2005. http://maude.cs.uiuc.edu

  11. Clavel, M., Meseguer, J.: Axiomatizing reflective logics and languages. In: Kiczales, G. (ed.) Reflection’96, pp. 263–288 (1996). http://jerry.cs.uiuc.edu/reflection/

  12. Clavel, M., Meseguer, J.: Reflection in conditional rewriting logic. Theor. Comput. Sci. 285(2), 245–288 (2002)

    Article  MathSciNet  Google Scholar 

  13. Ding, H., Zheng, C., Agha, G., Sha, L.: Automated verification of the dependability of object-oriented real-time systems. In: Proc. 9th IEEE International Workshop on Object-Oriented Real-Time Dependable Systems (WORDS’03). IEEE Computer Society Press (2003)

  14. Eker, S., Meseguer, J., Sridharanarayanan, A.: The Maude LTL model checker. In: Gadducci, F., Montanari, U. (eds.) Fourth International Workshop on Rewriting Logic and its Applications, vol. 71 of Electronic Notes in Theoretical Computer Science. Elsevier (2002)

  15. Henzinger, T.A., Ho, P.-H., Wong-Toi, H.: HyTech: A model checker for hybrid systems. Softw. Tools Technol. Trans. 1, 110–122 (1997)

    Article  MATH  Google Scholar 

  16. Henzinger, T.A., Kopke, P.W., Puri, A., Varaiya, P.: What’s decidable about hybrid automata? J. Comput. Syst. Sci. 57, 94–124 (1998)

    Article  MATH  MathSciNet  Google Scholar 

  17. Holzmann, G.J.: The model checker SPIN. IEEE Trans. Softw. Eng. 23(5), 279–295 (1997)

    Article  Google Scholar 

  18. Kasera, S., Bhattacharyya, S., Keaton, M., Kiwior, D., Kurose, J., Towsley, D., Zabele, S.: Scalable fair reliable multicast using active services. IEEE Netw. Mag. (Special Issue on Multicast) 14(1), 48–57 (2000)

    Google Scholar 

  19. Larsen, K.G., Pettersson, P., Yi, W.: Uppaal in a nutshell. Int. J. Softw. Tools Technol. Transfer 1(1–2), 134–152 (1997)

    Google Scholar 

  20. Lien, E.: Formal modelling and analysis of the NORM multicast protocol using Real-Time Maude. Master’s thesis, Department of Linguistics, University of Oslo, 2004.

  21. Manna, Z., Pnueli, A.: Models for reactivity. Acta Informatica 30, 609–678 (1993)

    Article  MATH  MathSciNet  Google Scholar 

  22. Meseguer, J.: Membership algebra as a logical framework for equational specification. In: Parisi-Presicce, F. (ed.) Proc. WADT’97, vol. 1376 of Lecture Notes in Computer Science, pp. 18–61. Springer (1998)

  23. Ölveczky, P.C., Caccamo, M.: Formal simulation and analysis of the CASH scheduling algorithm in Real-Time Maude. In Baresi, L., Heckel, R. (eds.) Fundamental Approaches to Software Engineering (FASE’06), vol. 3922 of Lecture Notes in Computer Science, pp. 357–372. Springer (2006).

  24. Ölveczky, P.C., Keaton, M., Meseguer, J., Talcott, C., Zabele, S.: Specification and analysis of the AER/NCA active network protocol suite in Real-Time Maude. In: Hussmann, H. (ed.) Fundamental Approaches to Software Engineering (FASE 2001), vol. 2029 of Lecture Notes in Computer Science, pp. 333–347. Springer (2001)

  25. Ölveczky, P.C., Meseguer, J., Talcott, C.L.: Specification and analysis of the AER/NCA active network protocol suite in Real-Time Maude. Technical Report UIUCDCS-R-2004-2467, Department of Computer Science, University of Illinois at Urbana-Champaign (2004) Available at http://www.ifi.uio.no/RealTimeMaude

  26. Ölveczky, P.C., Meseguer, J.: Real-Time Maude: A tool for simulating and analyzing real-time and hybrid systems. In Futatsugi, K. (ed.) Third International Workshop on Rewriting Logic and its Applications, vol. 36 of Electronic Notes in Theoretical Computer Science. Elsevier (2000) http://www.elsevier.nl/locate/entcs/volume36.html

  27. Ölveczky, P.C., Meseguer, J.: Specification of real-time and hybrid systems in rewriting logic. Theor. Comput. Sci. 285, 359–405 (2002)

    Article  MATH  Google Scholar 

  28. Ölveczky, P.C., Thorvaldsen, S.: Formal modeling and analysis of wireless sensor network algorithms in Real-Time Maude. In 20th International Parallel and Distributed Processing Symposium (IPDPS 2006). IEEE Computer Society Press (2006)

  29. Ölveczky, P.C.: Specification and Analysis of Real-Time and Hybrid Systems in Rewriting Logic. PhD thesis, University of Bergen (2000) Available at http://maude.cs.uiuc.edu/papers

  30. Ölveczky, P.C.: Real-Time Maude 2.1 Manual (2004) http://www.ifi.uio.no/RealTime Maude/

  31. Viry, P.: Equational rules for rewriting logic. Theor. Comput. Sci. 285, 487–517 (2002)

    Article  MATH  MathSciNet  Google Scholar 

  32. Yovine, S.: Kronos: A verification tool for real-time systems. Softw. Tools Technol. Trans. 1(1–2), 123–133 (1997)

    Article  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Informatics, University of Oslo, Oslo, Norway

    Peter Csaba Ölveczky

  2. Department of Computer Science, University of Illinois at Urbana-Champaign, Urbana-Champaign, USA

    José Meseguer

Authors
  1. Peter Csaba Ölveczky
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. José Meseguer
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Peter Csaba Ölveczky.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Ölveczky, P.C., Meseguer, J. Semantics and pragmatics of Real-Time Maude. Higher-Order Symb Comput 20, 161–196 (2007). https://doi.org/10.1007/s10990-007-9001-5

Download citation

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10990-007-9001-5

Keywords

Search

Navigation