Partial-order reduction in the weak modal mu-calculus
From MaRDI portal
Publication:6044105
DOI10.1007/3-540-63141-0_2zbMath1512.68160OpenAlexW1513924733MaRDI QIDQ6044105
Scott A. Smolka, Y. S. Ramakrishna
Publication date: 17 May 2023
Published in: CONCUR '97: Concurrency Theory (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/3-540-63141-0_2
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 (7)
Process Algebra and Model Checking ⋮ Compositional verification of concurrent systems by combining bisimulations ⋮ Unnamed Item ⋮ Exponential automatic amortized resource analysis ⋮ Partial order reduction for reachability games ⋮ Partial-Order Reduction for Parity Games with an Application on Parameterised Boolean Equation Systems ⋮ Compositional State Space Reduction Using Untangled Actions
Cites Work
- Unnamed Item
- Unnamed Item
- A stubborn attack on state explosion
- Results on the propositional \(\mu\)-calculus
- Combining partial-order reductions with on-the-fly model-checking.
- Local model checking in the modal mu-calculus
- Computer aided verification. 5th international conference, CAV '93, Elounda, Greece, June 28 - July 1, 1993. Proceedings
- A partial approach to model checking
- Using partial orders for the efficient verification of deadlock freedom and safety properties
- Computer aided verification. 8th international conference, CAV '96, New Brunswick, NJ, USA, July 31 -- August 3, 1996. Proceedings
- Automatic verification of finite-state concurrent systems using temporal logic specifications
- Process algebra for synchronous communication
- Three logics for branching bisimulation
- Efficient local correctness checking for single and alternating boolean equation systems
- Depth-First Search and Linear Graph Algorithms
This page was built for publication: Partial-order reduction in the weak modal mu-calculus
