Parameterised Boolean equation systems

DOI10.1016/j.tcs.2005.06.016zbMath1077.68061OpenAlexW2139470733MaRDI QIDQ2571204

Jan Friso Groote, Tim A. C. Willemse

Publication date: 1 November 2005

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: http://hdl.handle.net/2066/32828

zbMATH Keywords

model checkinginfinite state systemsparameterised Boolean equation systemsfirst-order modal \(\mu\)-calculus

Mathematics Subject Classification ID

Specification and verification (program logics, model checking, etc.) (68Q60) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Related Items (13)

Abstraction in Fixpoint Logic ⋮ Consistent Consequence for Boolean Equation Systems ⋮ Exponential automatic amortized resource analysis ⋮ Unnamed Item ⋮ Invariants for Parameterised Boolean Equation Systems ⋮ Fold/Unfold Transformations for Fixpoint Logic ⋮ Partial-Order Reduction for Parity Games with an Application on Parameterised Boolean Equation Systems ⋮ Invariants for parameterised Boolean equation systems ⋮ A linear translation from CTL\(^*\) to the first-order modal \(\mu \)-calculus ⋮ Verification of reactive systems via instantiation of parameterised Boolean equation systems ⋮ Static Analysis Techniques for Parameterised Boolean Equation Systems ⋮ Unnamed Item ⋮ Instantiation for Parameterised Boolean Equation Systems

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Results on the propositional \(\mu\)-calculus
• Model-checking processes with data
• Efficient local correctness checking for single and alternating boolean equation systems
• CONCUR 2004 - Concurrency Theory

This page was built for publication: Parameterised Boolean equation systems