An efficient algorithm for minimizing real-time transition systems

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 697 LNCS, Issue , 1993, Pages 210-224

  Yannakakis, Mihalis ^a   Lee, David ^a  

^a LUCENT TECHNOLOGIES   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 84883273725     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-56922-7_18     Document Type: Conference Paper

References (25)

1. R. Alur, C. Courcoubetis, and D. Dill. Model-checking for real-timed systems. In Proc. of the 5th IEEE Syrup. on Logic in Computer Science, pp. 414-425, 1990.
2. R. Alur, C. Courcoubetis, D. Dill, N. Halbwachs, and It Wong-Toi. An implementation of three algorithms for timing verification based on automata emptiness. In Proc. of Real-Time Systems Syrup., pp. 157-166, 1992.
3. R. Alur, C. Courcoubetis, N. Halbwachs, D. Dill and It Wong-Toi. Minimization of timed transition systems. In Proc. of CONCUR’9P, Springer-Verlag LNCS 630, pp. 341-354, 1992.
4. R. Alur, and D. Dill. Automata for modeling real-time systems. In Proc. of the 17th Intl. Colloq. on Automata, Languages and Programming, Springer-Verlag LNCS 443, pp. 322-335, 1990.
5. R. Alur, and T. Henzinger. A really temporal logic. In Proc. of the 30th IEEE Syrup. 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, ACMAMS, pp. 85-91, 1990.
7. A. Bouajjani, J. Fernandez, N. Halbwachs, P. Raymond, and C. Ratel. Minimal state graph generation. In Science of Computer Programming, to appear, 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 Syrup. 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, 1992.
10. E.M. Clarke, E.A. Emerson, and A.P. Sistla. Automatic Verification of Finite-State Concurrent Systems Using Temporal Logic Specifications. In A CM Trans. on Prog. Lang. and Sys., vol. 8, pp. 244-263, 1986.
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, ACM-AMS, pp. 207-218, 1990. Full version in Formal Methods in System Design, vol. 1, 1992.
13. C. Courcoubetis, and M. Yannakakis. Minimum and maximum delay problems in real-time systems. In Proc. 3rd Workshop on Computer-Aided Verification, 1990. Full version in Formal Methods in System Design, vol. 1, pp. 385-415, 1992.
14. D. Dill. Timing assumptions and verification of finite state concurrent systems. In Automatic Verification Methods for Finite-State Systems, J. Sifakis, ed., Springer Verlag LNCS 407, 1989.
15. T. Henzinger, X. Nicollin, J. Sifajis, and S. Yovine. Symbolic model-checking for real-time systems. In Proc. 7th IEEE IEEE Syrup. 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.
17. G. J. Holzmann. Design and Validation of Protocols, Prentice-Hall, Inc., Englewood Cliffs, New Jersey, 1990.
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.
19. D. Lee, and M. Yannakakis. Online minimization of transition systems. In Proc. ACM Syrup. on Theory of Computing, 1992.
20. H. Lewis. A logic of concrete time intervals. In Proc. 5th IEEE IEEE Syrup. on Logic in Computer Science, pp. 380-389, 1990.
21. R. Palge and R. Tarjan. Three Partition Refinement Algorithms. In SIAM J. on Computing, vol. 16, pp. 973-989, 1987.
22. J. D. Ullman and A. Van Gelder. Efficient Tests for Top-Down Termination of Logical Rules. In J. ACM, vol. 35, pp. 345-373, 1988.
23. M. Y. Vardi, and P. Wolper. An Automata-Theoretic Approach to Automatic Program Verification. In Proc. 1st IEEE 1EEE Syrup. 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.
25. H. Wong-Tei, personal communication, 1992.