Equivalence Checking for Infinite Systems Using Parameterized Boolean Equation Systems

DOI10.1007/978-3-540-74407-8_9MaRDI QIDQ3525633zbMATH OpenOpenAlexFDO

Authors Taolue Chen, B. Ploeger, Jaco van de Pol, T. 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)

Recommendations

• CONCUR 2004 - Concurrency Theory
• Parameterised Boolean equation systems
• Instantiation for Parameterised Boolean Equation Systems
• Verification of reactive systems via instantiation of parameterised Boolean equation systems
• Static Analysis Techniques for Parameterised Boolean Equation Systems

Cited in

(12)

• A comparison of BDD-based parity game solvers
• Invariants for Parameterised Boolean Equation Systems
• Static Analysis Techniques for Parameterised Boolean Equation Systems
• Fold/unfold transformations for fixpoint logic
• Abstraction in fixpoint logic
• CONCUR 2004 - Concurrency Theory
• Instantiation for Parameterised Boolean Equation Systems
• Equivalence checking 40 years after: a review of bisimulation tools
• On-the-fly solving for symbolic parity games
• Operations on fixpoint equation systems
• Verification of reactive systems via instantiation of parameterised Boolean equation systems
• Invariants for parameterised Boolean equation systems

Describes a project that uses

Uses Software

• LOTOS

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3525633)