Abstract
The equivalence checking problem consists in verifying that a system (e.g., a protocol) matches its abstract specification (e.g., a service) by comparing their Labeled Transition Systems (Ltss) modulo a given equivalence relation. Two approaches are traditionally used to perform equivalence checking: global verification requires to construct the two Ltss before comparison, whereas local (or on-the-fly) verification allows to explore them incrementally during comparison. The latter approach is able to detect errors even in prohibitively large systems, and therefore reveals more effective in combating state explosion.
Chapter PDF
References
Andersen, H.R.: Model Checking and Boolean Graphs. Theoretical Computer Science 126(1), 3–30 (1994)
Cleaveland, R., Sokolsky, O.: Equivalence and Preorder Checking for Finite-State Systems. In: Bergstra, J.A., Ponse, A., Smolka, S.A. (eds.) Handbook of Process Algebra, ch. 6, pp. 391–424. North-Holland, Amsterdam (2001)
Fernandez, J.-C., Mounier, L.: Verifying Bisimulations “On the Fly”. In: Quemada, J., Manas, J., Vázquez, E. (eds.) Proc. of FORTE 1990. North-Holland, Amsterdam (1990)
Fernandez, J.-C., Mounier, L.: A Tool Set for Deciding Behavioral Equivalences. In: Groote, J.F., Baeten, J.C.M. (eds.) CONCUR 1991. LNCS, vol. 527. Springer, Heidelberg (1991)
Garavel, H.: OPEN/CÆSAR: An Open Software Architecture for Verification, Simulation, and Testing. In: Steffen, B. (ed.) TACAS 1998. LNCS, vol. 1384, pp. 68–84. Springer, Heidelberg (1998)
Garavel, H., Lang, F., Mateescu, R.: An Overview of CADP 2001. EASST Newsletter 4, 13–24 (2002): Also available as INRIA Report RT-0254
Hermanns, H., Siegle, M.: Bisimulation Algorithms for Stochastic Process Algebras and their BDD-based Implementation. In: Katoen, J.-P. (ed.) AMAST-ARTS 1999, ARTS 1999, and AMAST-WS 1999. LNCS, vol. 1601, pp. 244–265. Springer, Heidelberg (1999)
Joubert, C., Mateescu, R.: Distributed On-the-Fly Equivalence Checking. In: Brim, L., Leucker, M. (eds.) Proc. of PDMC 2004 (London, United Kingdom). ENTCS (September 2004) (to appear)
Mateescu, R.: A Generic On-the-Fly Solver for Alternation-Free Boolean Equation Systems. In: Garavel, H., Hatcliff, J. (eds.) TACAS 2003. LNCS, vol. 2619, pp. 81–96. Springer, Heidelberg (2003), Full version available as INRIA Research Report RR-4711
http://www.inrialpes.fr/vasy/cadp/resources/benchmark_bcg.html
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2005 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Bergamini, D., Descoubes, N., Joubert, C., Mateescu, R. (2005). BISIMULATOR: A Modular Tool for On-the-Fly Equivalence Checking. In: Halbwachs, N., Zuck, L.D. (eds) Tools and Algorithms for the Construction and Analysis of Systems. TACAS 2005. Lecture Notes in Computer Science, vol 3440. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-31980-1_42
Download citation
DOI: https://doi.org/10.1007/978-3-540-31980-1_42
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-25333-4
Online ISBN: 978-3-540-31980-1
eBook Packages: Computer ScienceComputer Science (R0)