Skip to main content
Log in

An Efficient Algorithm for Minimizing Real-Time Transition Systems

  • Published:
Formal Methods in System Design Aims and scope Submit manuscript

Abstract

We address the problem of performing simultaneously reachability analysis and minimization of real-time transition systems represented by timed automata, i.e., automata extended with a finite set of clock variables. The transitions of the automaton may depend on the values of the clocks and may reset some of the clocks. An efficient algorithm is presented for minimizing a system with respect to a given initial partition that respects the enabling conditions of the transitions of the timed automaton. Our algorithm generates the portion of the minimized system that is reachable from a given initial configuration in time polynomial in the input and the size of the minimal reachable system.

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

Access this article

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

Instant access to the full article PDF.

Similar content being viewed by others

References

  1. R. Alur, C. Courcoubetis, and D. Dill, “Model-checking for real-timed systems,” in Proc. of the 5th IEEE Symp. on Logic in Computer Science, pp. 414-425, 1990.

  2. R. Alur, C. Courcoubetis, D. Dill, N. Halbwachs, and H. Wong-Toi, “An implementation of three algorithms for timing verification based on automata emptiness,” in Proc. of Real-Time Systems Symp., pp. 157-166, 1992.

  3. R. Alur, C. Courcoubetis, N. Halbwachs, D. Dill, and H. Wong-Toi, “Minimization of timed transition systems,” in Proc. of CONCUR'92, Vol. LNCS 630, pp. 341-354, Springer-Verlag, 1992.

    Google Scholar 

  4. R. Alur and D. Dill, “Automata for modeling real-time systems,” in Proc. of the 17th Intl. Colloq. on Automata, Languages and Programming, Vol. LNCS 443, pp. 322-335, Springer-Verlag, 1990.

    Google Scholar 

  5. R. Alur and T. Henzinger, “A really temporal logic,” in Proc. of the 30th IEEE Symp. on Foundations of Computer Science, pp. 164-169, 1989.

  6. A. Bouajjani, J. Fernandez, and N. Halbwachs, “Minimal model generation,” in Proc. of the 2nd Workshop on Computer-Aided Verification, DIMACS Series, Vol. 3, pp. 85-91, ACM-AMS, 1990.

    Google Scholar 

  7. 7. A. Bouajjani, J. Fernandez, N. Halbwachs, P. Raymond, and C. Ratel, “Minimal state graph generation,” in Science of Computer Programming, Vol. 18, No. 3, 1992.

  8. J.R. Burch, E.M. Clarke, L.L. McMillan, D.L. Dill, and L.J. Hwang, “Symbolic model checking: 1020 states and beyond,” in Proc. 5th IEEE IEEE Symp. on Logic in Computer Science, pp. 428-439, 1990.

  9. K. Cerans, “Decidability of bisimulation equivalences for parallel timer processes,” in Proc. of the 4th Workshop on Computer-Aided Verification, Vol. LNCS, Springer-Verlag, 1992.

  10. E.M. Clarke, E.A. Emerson, and A.P. Sistla, “Automatic verification of finite-state concurrent systems using temporal logic specifications,” in ACM Trans. on Prog. Lang. and Sys., Vol. 8, pp. 244-263, 1986.

    Google Scholar 

  11. T.H. Corman, C.E. Leiserson, and R.L. Rivest, Introduction to Algorithms, McGraw Hill, New York, 1990.

  12. C. Courcoubetis, M. Vardi, P. Wolper, and M. Yannakakis, “Memory efficient algorithms for the verification of temporal properties,” in Proc. 2nd Workshop on Computer-Aided Verification, DIMACS Series Vol. 3, pp. 207-218, ACM-AMS, 1990. Full version in Formal Methods in System Design, Vol. 1, 1992.

    Google Scholar 

  13. C. Courcoubetis and M. Yannakakis, “Minimum and maximum delay problems in real-time systems,” in Proc. 3rd Workshop on Computer-Aided Verification, Vol. LNCS, Springer-Verlag, 1990. Full version in Formal Methods in System Design, Vol. 1, pp. 385-415, 1992.

    Google Scholar 

  14. 14. D. Dill, “Timing assumptions and verification of finite state concurrent systems,” in Automatic Verification Methods for Finite-State Systems, J. Sifakis (Ed.), Vol. LNCS 407, Springer Verlag, 1989.

  15. T. Henzinger, X. Nicollin, J. Sifakis, and S. Yovine, “Symbolic model-checking for real-time systems,” in Proc. 7th IEEE IEEE Symp. on Logic in Computer Science, 1992

  16. G.J. Holzmann, “An improved protocol reachability analysis,” in Software, Practice and Experience, Vol. 18, pp. 137-161, 1988.

    Google Scholar 

  17. G.J. Holzmann, Design and Validation of Protocols, Prentice-Hall, Inc., Englewood Cliffs, New Jersey, 1990.

    Google Scholar 

  18. P. Kanellakis and S. Smolka, “CCS expressions, finite state processes and three problems of equivalence,” in Information and Computation, Vol. 86, pp. 43-68, 1983.

    Google Scholar 

  19. D. Lee and M. Yannakakis, “Online minimization of transition systems,” in Proc. ACM Symp. on Theory of Computing, pp. 264-274, 1992.

  20. H. Lewis, “A logic of concrete time intervals,” in Proc. 5th IEEE IEEE Symp. on Logic in Computer Science, pp. 380-389, 1990.

  21. R. Milner, Communication and Concurrency, Prentice-Hall Intl., London, UK, 1989.

    Google Scholar 

  22. R. Paige and R. Tarjan, “Three partition refinement algorithms,” in SIAM J. on Computing, Vol. 16, pp. 973-989, 1987.

    Google Scholar 

  23. M.Y. Vardi and P. Wolper, “An automata-theoretic approach to automatic program verification,” in Proc. 1st IEEE IEEE Symp. on Logic in Computer Science, pp. 322-331, 1986.

  24. C.H. West. “Generalized technique for communication protocol validation,” in IBM J. Research and Development, Vol. 22, pp. 393-404, 1978.

    Google Scholar 

  25. H. Wong-Toi, personal communication, 1992.

Download references

Author information

Authors and Affiliations

Authors

Rights and permissions

Reprints and permissions

About this article

Cite this article

Yannakakis, M., Lee, D. An Efficient Algorithm for Minimizing Real-Time Transition Systems. Formal Methods in System Design 11, 113–136 (1997). https://doi.org/10.1023/A:1008621829508

Download citation

  • Issue Date:

  • DOI: https://doi.org/10.1023/A:1008621829508

Navigation