Skip to main content

Efficient scaling-invariant checking of timed bisimulation

  • Specification and Verification
  • Conference paper
  • First Online:
STACS 97 (STACS 1997)

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

Included in the following conference series:

Abstract

Bisimulation is an important notion for the verification of distributed systems. Timed bisimulation is its natural extension to real time systems. Timed bisimulation is known to be decidable for timed automata using the so-called region technique. We present a new, top down approach to timed bisimulation which applies the zone technique from the theory of hybrid systems. In contrast to the original decision algorithm, our method has a better space complexity and is scaling invariant: altering the time scale does not effect the space complexity.

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.

References

  1. R. Alur, C. Courcoubetis, D. Dill. Modelchecking in dense real-time. Information and Computation, 104(1):2–34, May 1993.

    Article  Google Scholar 

  2. R. Alur,C. Courcoubetis, N. Halbwachs, T.A. Henzinger, et al. The algorithmic analysis of hybrid systems. TCS, February 1995.

    Google Scholar 

  3. R. Alur, C. Courcoubetis, T.A. Henzinger. The observational power of clocks. CONCUR 94, LNCS 836, Springer 1994, pp. 162–177.

    Google Scholar 

  4. R. Alur, D.L. Dill. A Theory of Timed Automata. in: Theoretical Computer Science Vol. 126, No. 2, April 1994, pp. 183–236.

    Article  Google Scholar 

  5. R. Alur, T.A. Henzinger, M.Y. Vardi. Parametric real-time reasoning. Proc. 25th STOC, ACM Press 1993, pp. 592–601.

    Google Scholar 

  6. K. Čerāns. Decidability of Bisimulation Equivalences for Parallel Timer Processes. in: Proc. CAV '92, LNCS 663, pp. 302–315.

    Google Scholar 

  7. K. Čerāns, J.C. Godsken, K.G. Larsen. Timed Modal Specification — Theory and Tools. in: Proc. CAV '93, LNCS 697, pp. 253–267.

    Google Scholar 

  8. D.L. Dill. Timing Assumptions and Verification of Finite-State Concurrent Systems. in: LNCS 407, Springer Berlin 1989, pp. 197–212.

    Google Scholar 

  9. T.A. Henzinger, O. Kupferman, M.Y. Vardi. A Space-Efficient On-the-fly Algorithm for Real-Time Model Checking. in: Proc. CONCUR 96.

    Google Scholar 

  10. T.A. Henzinger, X. Nicollin, J. Sifakis, S. Yovine. Symbolic Model Checking for Real-time Systems. LICS '92, pp. 1–13.

    Google Scholar 

  11. D. Lee, M. Yannakakis. An efficient algorithm or minimizing real-time transition systems. CAV '93, LNCS 697, Springer Berlin 1993, pp. 210–223.

    Google Scholar 

  12. K.G. Larsen, B. Steffen, C. Weise. Fischer's Protocol Revisited: A Simple Proof Using Modal Constraints. in: LNCS 1066, Springer 1996.

    Google Scholar 

  13. N. Lynch, F. Vaandrager. Forward and Backward Simulations for Timing-Based Systems. in: REX Workshop, LNCS 600, pp. 397–446, 1991.

    Google Scholar 

  14. R. Milner. Communication and Concurrency. Prentice-Hall, 1989.

    Google Scholar 

  15. X. Nicollin, J. Sifakis, S. Yovine. From ATP to Timed Graphs and Hybrid Systems. Acta Informatica 30, 1993, S. 181–202.

    Article  Google Scholar 

  16. C. Weise, D. Lenzkes. A Fast Decision Algorithm for Timed Refinement. AIB 96-11, Technical Report University of Tech. Aachen, 1996.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Rüdiger Reischuk Michel Morvan

Rights and permissions

Reprints and permissions

Copyright information

© 1997 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Weise, C., Lenzkes, D. (1997). Efficient scaling-invariant checking of timed bisimulation. In: Reischuk, R., Morvan, M. (eds) STACS 97. STACS 1997. Lecture Notes in Computer Science, vol 1200. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0023458

Download citation

  • DOI: https://doi.org/10.1007/BFb0023458

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-62616-9

  • Online ISBN: 978-3-540-68342-1

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics