Skip to main content

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

Abstract

We provide a framework for distributed systems that impose timing constraints on their executions. We propose a timed model of communicating finite-state machines, which communicate by exchanging messages through channels and use event clocks to generate collections of timed message sequence charts (T-MSCs). As a specification language, we propose a monadic second-order logic equipped with timing predicates and interpreted over T-MSCs. We establish expressive equivalence of our automata and logic. Moreover, we prove that, for (existentially) bounded channels, emptiness and satisfiability are decidable for our automata and logic.

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

Access this chapter

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Similar content being viewed by others

References

  1. Alur, R., Dill, D.L.: A theory of timed automata. TCS 126(2), 183–235 (1994)

    Article  MathSciNet  MATH  Google Scholar 

  2. Alur, R., Fix, L., Henzinger, T.A.: Event-clock automata: A determinizable class of timed automata. TCS 211(1-2), 253–273 (1999)

    Article  MathSciNet  MATH  Google Scholar 

  3. Alur, R., Holzmann, G., Peled, D.: An analyser for message sequence charts. In: Margaria, T., Steffen, B. (eds.) TACAS 1996. LNCS, vol. 1055, pp. 35–48. Springer, Heidelberg (1996)

    Chapter  Google Scholar 

  4. Ben-Abdallah, H., Leue, S.: Timing constraints in message sequence chart specifications. In: Proc. of FORTE 1997, pp. 91–106 (1997)

    Google Scholar 

  5. Bollig, B., Leucker, M.: Message-passing automata are expressively equivalent to EMSO logic. TCS 358(2-3), 150–172 (2006)

    Article  MathSciNet  MATH  Google Scholar 

  6. Brand, D., Zafiropulo, P.: On communicating finite-state machines. Journal of the ACM 30(2) (1983)

    Google Scholar 

  7. Büchi, J.: Weak second order logic and finite automata. Z. Math. Logik, Grundlag. Math. 5, 66–72 (1960)

    Article  Google Scholar 

  8. Chandrasekaran, P., Mukund, M.: Matching scenarios with timing constraints. In: Asarin, E., Bouyer, P. (eds.) FORMATS 2006. LNCS, vol. 4202, pp. 91–106. Springer, Heidelberg (2006)

    Chapter  Google Scholar 

  9. D’Souza, D.: A logical characterisation of event clock automata. International Journal of Foundations of Computer Science 14(4), 625–640 (2003)

    Article  MathSciNet  MATH  Google Scholar 

  10. D’Souza, D., Thiagarajan, P.S.: Product interval automata: A subclass of timed automata. In: Pandu Rangan, C., Raman, V., Ramanujam, R. (eds.) Foundations of Software Technology and Theoretical Computer Science. LNCS, vol. 1738, pp. 60–71. Springer, Heidelberg (1999)

    Chapter  Google Scholar 

  11. Genest, B., Kuske, D., Muscholl, A.: A Kleene theorem and model checking algorithms for existentially bounded communicating automata. IC 204(6), 920–956 (2006)

    MathSciNet  MATH  Google Scholar 

  12. Henriksen, J.G., Mukund, M., Kumar, K.N., Sohoni, M., Thiagarajan, P.S.: A theory of regular MSC languages. IC 202(1), 1–38 (2005)

    MathSciNet  MATH  Google Scholar 

  13. Krcal, P., Yi, W.: Communicating timed automata: The more synchronous, the more difficult to verify. In: Ball, T., Jones, R.B. (eds.) CAV 2006. LNCS, vol. 4144, pp. 243–257. Springer, Heidelberg (2006)

    Chapter  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

V. Arvind Sanjiva Prasad

Rights and permissions

Reprints and permissions

Copyright information

© 2007 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Akshay, S., Bollig, B., Gastin, P. (2007). Automata and Logics for Timed Message Sequence Charts. In: Arvind, V., Prasad, S. (eds) FSTTCS 2007: Foundations of Software Technology and Theoretical Computer Science. FSTTCS 2007. Lecture Notes in Computer Science, vol 4855. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-77050-3_24

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-77050-3_24

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-77049-7

  • Online ISBN: 978-3-540-77050-3

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics