Consistent Consequence for Boolean Equation Systems

DOI10.1007/978-3-642-27660-6_23zbMath1298.68173OpenAlexW1591886066MaRDI QIDQ2891375

Maciej Gazda, Tim A. C. Willemse

Publication date: 15 June 2012

Published in: SOFSEM 2012: Theory and Practice of Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-27660-6_23

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Logic in computer science (03B70) Specification and verification (program logics, model checking, etc.) (68Q60) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)

Related Items (4)

Abstraction in Fixpoint Logic ⋮ Cooking Your Own Parity Game Preorders Through Matching Plays ⋮ Parity game reductions ⋮ A formalisation of consistent consequence for Boolean equation systems

Cites Work

• Unnamed Item
• A linear algorithm to solve fixed-point equations on transition systems
• Infinite games played on finite graphs
• Two results in negation-free logic
• Property preserving abstractions for the verification of concurrent systems
• Parameterised Boolean equation systems
• Consistent Correlations for Parameterised Boolean Equation Systems with Applications in Correctness Proofs for Manipulations
• Simulation Relations for Alternating Parity Automata and Parity Games
• Static Analysis Techniques for Parameterised Boolean Equation Systems
• Fair Simulation Relations, Parity Games, and State Space Reduction for Büchi Automata
• Formal Techniques for Networked and Distributed Systems - FORTE 2005

This page was built for publication: Consistent Consequence for Boolean Equation Systems