Abstract
The problem of determining the coarsest partition stable with respect to a given binary relation, is known to be equivalent to the problem of finding the maximal bisimulation on a given structure. Such an equivalence has suggested efficient algorithms for the computation of the maximal bisimulation relation.
In this paper the simulation problem is rewritten in terms of coarsest stable partition problem allowing a more algebraic understanding of the simulation equivalence. On this ground, a new algorithm for deciding simulation is proposed. Such a procedure improves on either space or time complexity of previous simulation algorithms.
Chapter PDF
Similar content being viewed by others
Keywords
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
References
J. van Benthem. Modal Correspondence Theory. PhD thesis, Universiteit van Amsterdam, Instituut voor Logica en Grondslagenonderzoek van Exacte Wetenschappen, 1976.
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.
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.
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.
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.
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.
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.
D. Dams, R. Gerth, and O. Grumberg. Abstract interpretation of reactive systems. ACM Transactions on Programming Languages and Systems, 19(2):253–291, 1997.
N. Dershowitz and J.-P. Jouannaud. Rewrite Systems, volume B, chapter 6, pages 244–320. Elsevier/ MIT press, 1990.
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.
M. Forti and F. Honsell. Set theory with free construction principles. Annali Scuola Normale Superiore di Pisa, Cl. Sc., IV(10):493–522, 1983.
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.
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.
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.
R. Milner. A calculus of communicating systems. In G. Goos and J. Hartmanis, editors, Lecture Notes on Computer Science, volume 92. Springer, 1980.
O. Grumberg and D.E. Long. Model checking and modular verification. ACM Transactions on Programming Languages and systems, 16(3):843–871, 1994.
R. Paige and R. E. Tarjan. Three partition refinement algorithms. SIAM Journal on Computing, 16(6):973–989, 1987.
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.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2002 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Gentilini, R., Piazza, C., Policriti, A. (2002). Simulation as Coarsest Partition Problem. In: Katoen, JP., Stevens, P. (eds) Tools and Algorithms for the Construction and Analysis of Systems. TACAS 2002. Lecture Notes in Computer Science, vol 2280. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-46002-0_29
Download citation
DOI: https://doi.org/10.1007/3-540-46002-0_29
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-43419-1
Online ISBN: 978-3-540-46002-2
eBook Packages: Springer Book Archive