Equivalence Checking for Infinite Systems Using Parameterized Boolean Equation Systems

DOI10.1007/978-3-540-74407-8_9zbMath1151.68521OpenAlexW2125656483MaRDI QIDQ3525633

Taolue Chen, B. Ploeger, Jaco van de Pol, Tim A. C. Willemse

Publication date: 18 September 2008

Published in: CONCUR 2007 – Concurrency Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-540-74407-8_9

Mathematics Subject Classification ID

Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Related Items (9)

Abstraction in Fixpoint Logic ⋮ Equivalence checking 40 years after: a review of bisimulation tools ⋮ Unnamed Item ⋮ Invariants for Parameterised Boolean Equation Systems ⋮ Fold/Unfold Transformations for Fixpoint Logic ⋮ Invariants for parameterised Boolean equation systems ⋮ Verification of reactive systems via instantiation of parameterised Boolean equation systems ⋮ Static Analysis Techniques for Parameterised Boolean Equation Systems ⋮ Instantiation for Parameterised Boolean Equation Systems

Uses Software

• LOTOS

This page was built for publication: Equivalence Checking for Infinite Systems Using Parameterized Boolean Equation Systems