Equivalence Checking for Infinite Systems Using Parameterized Boolean Equation Systems

DOI10.1007/978-3-540-74407-8_9zbMATH Open1151.68521OpenAlexW2125656483MaRDI QIDQ3525633FDOQ3525633

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

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

Mathematics Subject Classification ID

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

Cited In (12)

• Invariants for parameterised Boolean equation systems
• Instantiation for Parameterised Boolean Equation Systems
• Verification of reactive systems via instantiation of parameterised Boolean equation systems
• Equivalence checking 40 years after: a review of bisimulation tools
• Operations on fixpoint equation systems
• CONCUR 2004 - Concurrency Theory
• Abstraction in fixpoint logic
• Title not available (Why is that?)
• Invariants for Parameterised Boolean Equation Systems
• Static Analysis Techniques for Parameterised Boolean Equation Systems
• On-the-fly solving for symbolic parity games
• Fold/unfold transformations for fixpoint logic

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)