Minimal model generation

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

Volumn 531 LNCS, Issue , 1991, Pages 197-203

  Bouajjani, A ^a   Fernandez, J C ^a   Halbwachs, N ^a  

^a IMAG/LGI ^*  (France)

Author keywords

[No Author keywords available]

Indexed keywords

ARTIFICIAL INTELLIGENCE; COMPUTER SCIENCE; COMPUTERS;

BISIMULATIONS; GENERATION ALGORITHM; MINIMAL MODEL GENERATIONS; MINIMAL STATE; MINIMALITY; STATE GRAPHS;

COMPUTER AIDED ANALYSIS;

EID: 84944382587     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/BFb0023733     Document Type: Conference Paper

References (11)

1. A. Aho, R. Sethi, J. Ullman. Compilers: Principles, Techniques and Tools. Addison-Wesley, 1986.
2. G. Berry and G. Gonthier. The synchronous programming language Esterel, design, semantics, implementation. Tech. Report 327, INRIA, 1985. To appear in Science of Computer Programming.
3. R. E. Bryant. Graph-based algorithms for boolean function manipulation. IEEE Transactions on Computers, C-35(8), 1986.
4. J.R. Burch, E.M. Clarke, K.L. McMillan, D.L. Dill, J. Hwang. Symbolic Model Checking: 1020 states and beyond. Technical Report, Carnegie Mellon University, 1989.
5. P. Caspi, D. Pilaud, N. Halbwachs, J. Plaice. Lustre: a declarative language for programming synchronous systems. In 14th POPL, january 1987.
6. E. Clarke, E.A. Emerson, A.P. Sistla. Automatic verification of finite state concurrent systems using temporal logic. In 10th. Annual Symp. on Principles of Programming Languages, 1983.
7. O. Coudert, C. Berthet, J. C. Madre. Verification of synchronous sequential machines based on symbolic execution. In International Workshop on Automatic Verification Methods for Finite State Systems, LNCS 407, Springer Verlag, 1989.
8. J. C. Fernandez. An implementation of an efficient algorithm for bisimulation equivalence. Science of Computer Programming, 13(2-3), May 1990.
9. P. Kanellakis and S. Smolka. CCS expressions, finite state processes and three problems of equivalence. In Proceedings ACM Symp. on Principles of Distributed Computing, 1983.
10. R. Paige and R. Tarjan. Three partition refinement algorithms. SIAM J. Comput., 16(6), 1987.
11. J.L. Richier, C. Rodriguez, J. Sifakis, J. Voiron. Verification in Xesar of the sliding window protocol. In 17th International Workshop on Protocol Specification Testing and Verification, 1987.