Skip to main content
SpringerLink
Log in

Making Timed Automata Communicate

  • Chapter
Formal Methods at the Crossroads. From Panacea to Foundational Support

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 2757))

  • 328 Accesses

Abstract

A computation model is introduced in which real-time constraints as well as data communications can be explicitely expressed. The model is presented in a graphical form. Its semantics is studied and algorithms to compute bisimulation equivalences for such graphs are proposed.

Supported by grant 69833020 from National Science Foundation of China.

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

    Article  MATH  MathSciNet  Google Scholar 

  2. Alur, R., Courcoubetis, C., Henzinger, T.A.: The Observational Power of Clocks. In: Jonsson, B., Parrow, J. (eds.) CONCUR 1994. LNCS, vol. 836, pp. 162–177. Springer, Heidelberg (1994)

    Chapter  Google Scholar 

  3. Asarin, E., Bozga, M., Kerbrat, A., Maler, O., Pnueli, A., Rasse, A.: Data-structures for the verification of timed automata. In: Maler, O. (ed.) HART 1997. LNCS, vol. 1201, pp. 346–360. Springer, Heidelberg (1997)

    Chapter  Google Scholar 

  4. Behrmann, G., Larsen, K.G., Pearson, J., Weise, C., Yi, W.: Efficient timed reachability analysis using clock difference diagrams. In: Halbwachs, N., Peled, D.A. (eds.) CAV 1999. LNCS, vol. 1633, pp. 341–353. Springer, Heidelberg (1999)

    Chapter  Google Scholar 

  5. Bengtsson, J., Larsen, K.G., Larsson, F., Pettersson, P., Yi, W.: UPPAAL-a tool suite for the automatic verification of real-time systems. In: Alur, R., Sontag, E.D., Henzinger, T.A. (eds.) HS 1995. LNCS, vol. 1066, pp. 232–243. Springer, Heidelberg (1996)

    Chapter  Google Scholar 

  6. Čerāns, K.: Decidability of Bisimulation Equivalences for Parallel Timer Processes. In: Probst, D.K., von Bochmann, G. (eds.) CAV 1992. LNCS, vol. 663, pp. 302–315. Springer, Heidelberg (1993)

    Google Scholar 

  7. Dill, D.L.: Timing Assumptions and Verification of Finite-state Concurrent Systems. In: Sifakis, J. (ed.) CAV 1989. LNCS, vol. 407, pp. 197–212. Springer, Heidelberg (1990)

    Google Scholar 

  8. D’Argenio, P.R., Katoen, J.-P., Ruys, T., Tretmans, J.: The Bounded Retransmisson Protocol must be on time! Report CTIT 97-03, University of Twente (1997)

    Google Scholar 

  9. Hennessy, M., Lin, H.: Symbolic Bisimulations. Theoretical Computer Science 138, 353–389 (1995)

    Article  MATH  MathSciNet  Google Scholar 

  10. Hennessy, M., Lin, H.: Proof Systems for Message-Passing Process Algebras. Formal Aspects of Computing 8, 397–407 (1996)

    Article  Google Scholar 

  11. Holzmann, G.J.: Design and validation of computer protocols. Prentice Hall, Englewood Cliffs (1991)

    Google Scholar 

  12. Jonnson, B., Parrow, J.: Deciding Bisimulation Equivalences for A Class of Non-finite-state Programs. Information and Computation (1992)

    Google Scholar 

  13. Lin, H.: Symbolic Transition Graph with Assignment. In: Sassone, V., Montanari, U. (eds.) CONCUR 1996. LNCS, vol. 1119. Springer, Heidelberg (1996)

    Google Scholar 

  14. Lin, H.: On-the-fly Instantiation of Value-passing Processes. In: Proc. Joint International Conferences on Formal Description Techniques for Distributed Systems and Communication Protocols and Protocol Specification, Testing and Verification, Paris, France, pp. 215–230. Kluwer Academic Publishers, Dordrecht (1998)

    Google Scholar 

  15. Lin, H., Yi, W.: Axiomatising Timed Automata. Acta Informatica 38, 277–305 (2002)

    Article  MATH  MathSciNet  Google Scholar 

  16. Milner, R.: Communication and Concurrency. Prentice-Hall, Englewood Cliffs (1989)

    MATH  Google Scholar 

  17. Reed, G.M., Roscoe, A.W.: A Timed Model for Communicating Sequential Processes. In: Kott, L. (ed.) ICALP 1986. LNCS, vol. 226, pp. 314–323. Springer, Heidelberg (1986)

    Google Scholar 

  18. Stevens, W.R.: TCP/IP Illustrated Volume 1: The Protocols. Addison-Wesley, Reading (1994)

    Google Scholar 

  19. Tripakis, S., Courcoubetis, C.: Extending PROMELA and SPIN for real time. In: Margaria, T., Steffen, B. (eds.) TACAS 1996. LNCS, vol. 1055, pp. 329–348. Springer, Heidelberg (1996)

    Google Scholar 

  20. Wang, Y.: A Calculus of Real Time Systems. PhD thesis, Chalmers University of Technology, Göteborg, Sweden (1991)

    Google Scholar 

  21. Wang, F.: Efficient data structure for fully symbolic verification of realtime software systems. In: Tiuryn, J. (ed.) FOSSACS 2000. LNCS, vol. 1784, pp. 208–222. Springer, Heidelberg (2000)

    Google Scholar 

  22. Wang, Y.: Efficient data structure for fully symbolic verification of realtime software systems. In: Proc. TACACS 2000 Held as Part of Joint European Conferences on Theory and Practice of Software, ETAPS 2000, Berlin,Germany. LNCS, vol. 1784, pp. 208–222. Springer, Heidelberg (2000)

    Google Scholar 

  23. Weise, C., Lenzkes, D.: Efficient Scaling-Invariant Checking of Timed Bisimulation. In: Reischuk, R., Morvan, M. (eds.) STACS 1997. LNCS, vol. 1200. Springer, Heidelberg (1997)

    Chapter  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Laboratory for Computer Science Institute of Software, Chinese Academy of Sciences, P.O. Box 8718, Beijing, 100080

    Jing Chen & Huimin Lin

Authors
  1. Jing Chen
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Huimin Lin
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Institute for Software Technology, Graz University of Technology, Austria

    Bernhard K. Aichernig

  2. Department of Computing and Software, McMaster University, 1280 Main St West, L8S 4K1, Hamilton, ON, Canada

    Tom Maibaum

Rights and permissions

Reprints and permissions

Copyright information

© 2003 Springer-Verlag Berlin Heidelberg

About this chapter

Cite this chapter

Chen, J., Lin, H. (2003). Making Timed Automata Communicate. In: Aichernig, B.K., Maibaum, T. (eds) Formal Methods at the Crossroads. From Panacea to Foundational Support. Lecture Notes in Computer Science, vol 2757. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-40007-3_21

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-40007-3_21

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-20527-2

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

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation