Parameterised Boolean equation systems

DOI10.1016/j.tcs.2005.06.016zbMath1077.68061MaRDI 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 checking; infinite state systems; parameterised Boolean equation systems; first-order modal \(\mu\)-calculus

Mathematics Subject Classification ID

68Q60: Specification and verification (program logics, model checking, etc.)

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

Related Items

Unnamed Item, Fold/Unfold Transformations for Fixpoint Logic, Partial-Order Reduction for Parity Games with an Application on Parameterised Boolean Equation Systems, Abstraction in Fixpoint Logic, Instantiation 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, Invariants for parameterised Boolean equation systems, Exponential automatic amortized resource analysis, Consistent Consequence for Boolean Equation Systems, Unnamed Item, Invariants for Parameterised Boolean Equation Systems, Static Analysis Techniques for Parameterised Boolean Equation Systems

Cites Work

• 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
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item