Simulation as coarsest partition problem

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

Volumn 2280 LNCS, Issue , 2002, Pages 415-430

  Gentilini, Raffaella ^a   Piazza, Carla ^a   Policriti, Alberto ^a  

^a UNIVERSITY OF UDINE   (Italy)

Author keywords

[No Author keywords available]

Indexed keywords

ARTIFICIAL INTELLIGENCE; COMPUTER SCIENCE; COMPUTERS;

BINARY RELATION; BISIMULATIONS; MAXIMAL BISIMULATION RELATION; PARTITION PROBLEM; SIMULATION ALGORITHMS; TIME COMPLEXITY;

COMPUTATIONAL EFFICIENCY;

EID: 84888234336     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-46002-0_29     Document Type: Conference Paper

References (18)

1. J. van Benthem. Modal Correspondence Theory. PhD thesis, Universiteit van Amsterdam, Instituut voor Logica en Grondslagenonderzoek van Exacte Weten-schappen, 1976.
2. B. Bloom. Ready Simulation, Bisimulation, and the Semantics of CCS-like Languages. PhD thesis, Department of Electrical Engineering and Computer Science, Massachusetts Institute of Technology, 1989.
3. Bard Bloom and Robert Paige. Transformational design and implementation of a new efficient solution to the ready simulation problem. Science of Computer Programming, 24(3):189-220, 1995.
4. D. Bustan and O. Grumberg. Simulation based minimization. In D.A. McAllester, editor, Proc. 17th Int'l Conference on Automated Deduction (CADE'00), Volume 1831 of LNCS, pages 255-270. Springer, 2000.
5. R. Cleaveland, J. Parrow, and B. Steffen. The Concurrency Workbench: A Semantics Based Tool for the Verification of Concurrent Systems. ACM Transactions on Programming Languages and Systems, 15(1):36-72, 1993.
6. R. Cleaveland and B. Steffen. A linear-time model-checking algorithm for the alternation-free modal mu-calculus. In K.G. Larsen and A. Skou, editors, Proceedings of Computer Aided Verification (CAV'91), Volume 575 of LNCS, pages 48-58. Springer, 1992.
7. R. Cleaveland and L. Tan. Simulation revised. In T. Margaria and W. Yi, editors, Proc. 7th Int'l Conference on Tools and Algorithms for the Construction and Analysis of Systems (TACAS'01), Volume 2031 of LNCS, pages 480-495. Springer, 2001.
8. D. Dams, R. Gerth, and O. Grumberg. Abstract interpretation of reactive systems. ACM Transactions on Programming Languages and Systems, 19(2):253-291, 1997.
9. N. Dershowitz and J.-P. Jouannaud. Rewrite Systems, volume B, chapter 6, pages 244-320. Elsevier/MIT press, 1990.
10. A. Dovier, C. Piazza, and A. Policriti. A fast bisimulation algorithm. In G. Berry, H. Comon, and A. Finkel, editors, Proceedings of Computer Aided Verification (CAV'01), Volume 2102 of LNCS, pages 79-90. Springer, 2001.
11. M. Forti and F. Honsell. Set theory with free construction principles. Annali Scuola Normale Superiore di Pisa, Cl. Sc., IV(10):493-522, 1983.
12. R. Gentilini, C. Piazza, and A. Policriti. Simulation as coarsest partition problem. RR 04-01, Dep. of Computer Science, University of Udine, Italy, 2001. Available at http://www.dimi.uniud.it/~piazza/simul.ps.gz.
13. M. R. Henzinger, T. A. Henzinger, and P. W. Kopke. Computing simulations on finite and infinite graphs. In 36th Annual Symposium on Foundations of Computer Science (FOCS'95), pages 453-462. IEEE Computer Society Press, 1995.
14. J.E. Hopcroft. An nlogn algorithm for minimizing states in a finite automaton. In Theory of Machines and Computations, Ed. by Zvi Kohavi and Azaria Paz, pages 189-196. Academic Press, 1971.
15. R. Milner. A calculus of communicating systems. In G. Goos and J. Hartmanis, editors, Lecture Notes on Computer Science, volume 92. Springer, 1980.
16. O. Grumberg and D.E. Long. Model checking and modular verification. ACM Transactions on Programming Languages and systems, 16(3):843-871, 1994.
17. R. Paige and R. E. Tarjan. Three partition refinement algorithms. SIAM Journal on Computing, 16(6):973-989, 1987.
18. R. Paige, R. E. Tarjan, and R. Bonic. A linear time solution to the single function coarsest partition problem. Theoretical Computer Science, 40(1):67-84, 1985.