Simulation-based minimization

ACM Transactions on Computational Logic

Volumn 4, Issue 2, 2003, Pages 181-206

  Bustan, Doron ^a   Grumberg, Orna ^a  

^a TECHNION ISRAEL INSTITUTE OF TECHNOLOGY   (Israel)

Author keywords

Minimization; Simulation

Indexed keywords

ISOMORPHISM; SIMULATION EQUIVALENCE; SIMULATION PREORDER; SPACE COMPLEXITY;

COMPUTATIONAL COMPLEXITY; COMPUTER SIMULATION; DESIGN AIDS; FORMAL LOGIC; INTEGRATED CIRCUITS; ITERATIVE METHODS; MATHEMATICAL MODELS; OPTIMIZATION; SOFTWARE ENGINEERING;

ALGORITHMS;

EID: 3042815539     PISSN: 15293785     EISSN: None     Source Type: Journal    
DOI: 10.1145/635499.635502     Document Type: Article

References (16)

1. AZIZ, A., SHIPLE, T., SINGHAL, V., AND SANGIOVANNI-VINCETELLY, A. 1994a. Formula-dependent equivalence for compositional CTL model checking. In Proceedings of the 6th Conference on Computer Aided Verification (CAV'94), D. Dill, Ed. Lecture Notes in Computer Science, vol. 818. Springer-Verlag, New York, 324-337.
2. AZIZ, A., SINGHAL, V., SWAMY, G., AND BRAYTON, R. 1994b. Minimizing interacting finite state machines: A compositional approach to language containment. In Proceedings of the International Conference on Computer Design. 255-261.
3. BLOOM, B. AND PAIGE, R. 1996. Transformational design and implementation of new efficient solution to the ready simulation problem. In Science of Computer Programming. Vol. 24. 189-220.
4. BOUAJJANI, A., PEHNANDEZ, J.-C., AND HALBWACHS, N. 1990. Minimal model generation. In Computer-Aided Verification, E. Clarke and R. Kurshan, Eds. Springer-Verlag, New York, 197-203.
5. BOUALI, A. AND DE SIMONE, R. 1992. Symbolic bisimulation minimization. In Proceedings of the 4th Conference on Computer-Aided Verification, G. V. Bochmann and D. K. Probst, Eds. Lecture Notes in Computer Science, vol. 663. Springer-Verlag, New York, 96-108.
6. CLARKE, E., GHUMBERG, O., AND PELED, D. 1999. Model Checking. MIT Press, Cambridge, Mass.
7. CLARKE, E. M. AND EMERSON, E. A. 1981. Synthesis of synchronization skeletons for branching time temporal logic. In Logic of Programs: Workshop Yorktown Heights, N.Y. Lecture Notes in Computer Science, vol. 131. Springer-Verlag, New York.
8. DAMS, D., GERTH, R., AND GRUMBERG, O. 1997. Abstract interpretation of reactive systems. ACM Trans. Prog. Lang. Syst. 19, 2 (Mar.).
9. FISLER, K. AND VARDI, M. 1998. Bisimulation minimization in an automata-theoretic verification framework. In Formal Methods in Computer-Aided Design (FMCAD). 115-132.
10. GRUMBERO, O. AND LONG, D. 1994. Model checking and modular verification. ACM Trans. Prog. Lang. Syst. 16, 3, 843-871.
11. HENZINGER, M., HENZINGER, T., AND KOPKE, P. 1995. Computing simulation on finite and infinite graphs. In Proceedings of the Symposium on Foundations of Computer Science. 453-462.
12. KUCERA, A. AND MAYR, R. 1999. Simulation preorder on simple process algebras. In International Colloquium on Automata, Languages and Programing. Lecture Notes in Computer Science, vol. 1644. Sringer-Verlag, New York.
13. LEE, D. AND YANNAKAKIS, M. 1992. Online minimization of transition systems. In Proceedings of the 24th ACM Symposium on Theory of Computing. ACM, New York.
14. LOISEAUX, C., GRAF, S., SIFAKIS, J., BOUAJJANI, A., AND BENSALEM, S. 1995. Property preserving abstractions for the verification of concurrent systems. Form. Meth. Syst. Des. 6, 1.
15. MILNER, R. 1971. An algebraic definition of simulation between programs. In Proceedings of the 2nd International Joint Conferences on Artificial Intelligence (IJCAI). (London, U.K.). 481-489.
16. PARK, D. 1981. Concurrency and automata on infinite sequences. In Proceedings of the 5th GI-Conference on Theoretical Computer Science. Lecture Notes in Computer Science, vol. 104. Springer-Verlag, New York, pp. 167-183.