Abstract
In this paper we propose an efficient algorithmic solution to the problem of determining a Bisimulation Relation on a finite structure. Starting from a set-theoretic point of view we propose an algorithm that optimizes the solution to the Relational coarsest Partition problem given by Paige and Tarjan in 1987 and its use in model-checking packages is briefly discussed and tested. Our algorithm reaches, in particular cases, a linear solution.
Author supplied keywords
Cite
CITATION STYLE
Dovier, A., Piazza, C., & Policriti, A. (2001). A fast Bisimulation algorithm. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 2102, pp. 79–90). Springer Verlag. https://doi.org/10.1007/3-540-44585-4_8
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
