Online minimization of transition systems

Proceedings of the Annual ACM Symposium on Theory of Computing

Volumn Part F129722, Issue , 1992, Pages 264-274

  Lee, David ^a   Yannakakis, Mihalis ^a  

^a LUCENT TECHNOLOGIES   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATION THEORY; COMPUTATIONAL COMPLEXITY; FINITE AUTOMATA; GRAPH THEORY; MATHEMATICAL TRANSFORMATIONS; MINIMIZATION OF SWITCHING NETS; NETWORK PROTOCOLS; STATE SPACE METHODS;

AFFINE TRANSFORMATIONS; COMPACT REPRESENTATION; EXTENDED FINITE STATE MACHINE; GENERAL SYSTEMS; PRIMITIVE OPERATIONS; REACHABILITY ANALYSIS; REACHABLE-GRAPH; TRANSITION SYSTEM;

ONLINE SYSTEMS; ALGORITHMS;

AFFINE TRANSFORMATIONS; ONLINE MINIMIZATION; REACHABILITY ANALYSIS; TRANSITION SYSTEMS;

EID: 0026998940     PISSN: 07378017     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/129712.129738     Document Type: Conference Paper

References (25)

1. Alur, R., Courcoubetis, C, and Dill, D. [1990]. Model Checking for Real Time Systems, in Proc. 5 th IEEE LICS.
2. Bouajjani, A., Fernandez, J-C, and Halbwachs, N. [1990]. Minimal Model Generation, in Proc. 2nd Workshop on Computer-Aided Verification, DIMACS Series Vol. 3, ACM-AMS.pp. 85-91.
3. Bouajjani, A., Fernandez, J-C, Halbwachs, N, Raymond, P. and Ratei, C. [1991]. Minimal State Graph Generation, IMAG Grenoble Preprint.
4. Bryant, R. E. [1986]. Graph-based Algorithms for Boolean Function Manipulation, in IEEE Trans, on Computers, vol. 35.
5. Budkowski, S. and Dembinski, P. [1987]. An Introduction to Estelle: a Specification Lan- guage for Distributed Systems, in Computer Networks and ISDN Systems 14, pp. 3-23.
6. Burch, J. R, Clarke, E. M, McMillan, K. L., Dill, D. L., and Hwang, L. J. [1990]. Symbolic Model Checking: 1020 States and Beyond, in Proc. 5th IEEE UCS, pp. 428-439.
7. Clarke, E.M., Emerson, E.A., and Sistla, AP. [1986]. Automatic Verification of Finite-State Concurrent Systems Using Temporal Logic Specifications, in ACM Trans, on Prog. Lang. andSys., vol. 8, pp. 244-263.
8. Cohen, E. and Meggido, N. [1991]. Improved Algorithms for Linear Inequalities with Two Variables per Inequality, in Proc. 23rd Annual ACM Symp. on Theory of Computing, pp. 145155.
9. Coudert, O., Berthet, C, and Madre, J. C. [1989]. Verification of Synchronous Sequential Machines Based on Symbolic Execution, in Proc. Intl. Workshop on Automatic Verification Methods for Finite State Systems, LNCS 407, Springer Verlag.
10. Courcoubetis, C, Vardi, M., Wolper, P. and Yannakakis, M. [1990]. 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.
11. Graf, S. and Steffen B. [1991]. Compositional Minimization of Finite State Systems, in Proc. 2nd Workshop on Computer-Aided Verification, DIMACS Series Vol. 3, ACM-AMS, pp. 57-73.
12. Hochbaum, D.S. and Naor, J. [1991]. Simple and Fast Algorithms for Linear and Integer Programs with Two Variables Per Inequality, manuscript.
13. Holzmann, G. J. [1988]. An Improved Protocol Reachability Analysis, in Software, Practice and Experience, vol. 18, pp. 137-161.
14. Holzmann, G. J. [1991]. Design and Validation of Protocols, Prentice-Hall, Inc., Englewood Cliffs, New Jersey.
15. Hopcroft, J. E. [1971]. An n log n Algorithm for Minimizing States in a Finite Automaton, in Theory of Machines and Computations, Z. Kohavi and A. Paz (eds.), pp. 189-196, Academic Press, New York.
16. Jard, C. and Jeron, T. [1989]. On-line Modelchecking for Finite Linear Temporal Logic Specifications, in Proc. Intl. Workshop on Automatic Verification Methods for Finite State Systems, LNCS 407, Springer Verlag, pp. 189-196.
17. Kanellakis, P. and Smolka, S. [1983]. CCS Expressions, Finite State Processes and Three Problems of Equivalence, in Information and Computation, vol. 86, pp. 43-68.
18. Logical Link Control [1989]. International Standard ISO 8802-2, IEEE Std. 802.2, The Institute of Electrical and Electronics Engineers, Inc.
19. Paige, R. and Tarjan, R. [1987]. Three Partition Refinement Algorithms, in SIAM /. on Computing, vol. 16, pp. 973-989.
20. Pnueli, A. [1986], Applications of Temporal Logic to the Specification and Verification of Reactive Systems: a Survey of Current Trends, in Current Trends in Concurrency, LNCS 224, Springer Verlag, pp. 510-584.
21. Sidhu, D. P. and Leung, T.-K. [1989]. Formal Methods for Protocol Testing: A Detailed Study, in IEEE Trans, on Soft. Eng., vol 15, pp. 413-426.
22. Sifakis, J. [1982]. A Unified Approach for Studying the Properties of Transition Systems, in Theoretical Computer Sciences.
23. Vardi, M. Y. and Wolper, P. [1986]. An Automata-Theoretic Approach to Automatic Program Verification, in Proc. LICS, pp. 322331.
24. West, C. H. [1978] Generalized Technique for Communication Protocol Validation, in IBM J. Res. andDevel., vol. 22, pp. 393-404.
25. Yannakakis, M. and Lee, D. [1991]. Testing Finite State Machines, in Proc. of the 23rd Annual ACM Symposium on Theory of Computing, pp. 476-485.