Abstract
In this paper, we provide a transformation from the branching bisimulation problem for infinite, concurrent, data-intensive systems in linear process format, into solving Parameterized Boolean Equation Systems. We prove correctness, and illustrate the approach with an unbounded queue example. We also provide some adaptations to obtain similar transformations for weak bisimulation and simulation equivalence. © Springer-Verlag Berlin Heidelberg 2007.
Cite
CITATION STYLE
Chen, T., Ploeger, B., Van Pol, J. D., & Willemse, T. A. C. (2007). Equivalence checking for infinite systems using parameterized boolean equation systems. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 4703 LNCS, pp. 120–135). Springer Verlag. https://doi.org/10.1007/978-3-540-74407-8_9
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
