Equivalence Checking for Infinite Systems Using Parameterized Boolean Equation Systems
From MaRDI portal
Publication:3525633
DOI10.1007/978-3-540-74407-8_9zbMath1151.68521MaRDI 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
68Q85: Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.)
Related Items
Fold/Unfold Transformations for Fixpoint Logic, Abstraction in Fixpoint Logic, Instantiation for Parameterised Boolean Equation Systems, Equivalence checking 40 years after: a review of bisimulation tools, Verification of reactive systems via instantiation of parameterised Boolean equation systems, Invariants for parameterised Boolean equation systems, Unnamed Item, Invariants for Parameterised Boolean Equation Systems, Static Analysis Techniques for Parameterised Boolean Equation Systems
Uses Software