Using partial orders for the efficient verification of deadlock freedom and safety properties
From MaRDI portal
Publication:6493552
DOI10.1007/3-540-55179-4_32MaRDI QIDQ6493552FDOQ6493552
Authors: Patrice Godefroid, Pierre Wolper 
Publication date: 29 April 2024
Cites Work
- Decidability of Second-Order Theories and Automata on Infinite Trees
- Automatic verification of finite-state concurrent systems using temporal logic specifications
- Title not available (Why is that?)
- The complementation problem for Büchi automata with applications to temporal logic
- Title not available (Why is that?)
- Recognizing safety and liveness
- Proving Liveness Properties of Concurrent Programs
- Title not available (Why is that?)
- A partial approach to model checking
- Title not available (Why is that?)
- Adequate proof principles for invariance and liveness properties of concurrent programs
- Title not available (Why is that?)
- Exponential Determinization for ω‐Automata with a Strong Fairness Acceptance Condition
This page was built for publication: Using partial orders for the efficient verification of deadlock freedom and safety properties
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6493552)
