Partial-Order Reduction for Parity Games with an Application on Parameterised Boolean Equation Systems
From MaRDI portal
Publication:5164176
DOI10.1007/978-3-030-45237-7_19zbMath1483.68201OpenAlexW3016583929MaRDI QIDQ5164176
Wieger Wesselink, Thomas Neele, Tim A. C. Willemse
Publication date: 10 November 2021
Published in: Tools and Algorithms for the Construction and Analysis of Systems (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-030-45237-7_19
Applications of game theory (91A80) Logic in computer science (03B70) 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
Cites Work
- Invariants for the construction of a handshake register
- Confluence for process verification
- A stubborn attack on state explosion
- Results on the propositional \(\mu\)-calculus
- Combining partial-order reductions with on-the-fly model-checking.
- A calculus of communicating systems
- A partial order approach to branching time logic model checking.
- Partial-order methods for the verification of concurrent systems. An approach to the state-explosion problem
- The inconsistent labelling problem of stutter-preserving partial-order reduction
- Parameterised Boolean equation systems
- Proof Graphs for Parameterised Boolean Equation Systems
- Partial order reduction for checking LTL formulae with the next-time operator
- Liveness Analysis for Parameterised Boolean Equation Systems
- Stubborn Set Intuition Explained
- Partial order reduction for reachability games
- Partial-order reduction in the weak modal mu-calculus
- Unnamed Item
- Unnamed Item
- Unnamed Item