Using partial orders for the efficient verification of deadlock freedom and safety properties
From MaRDI portal
Publication:6493552
Cites work
- scientific article; zbMATH DE number 176726 (Why is no real title available?)
- scientific article; zbMATH DE number 177237 (Why is no real title available?)
- scientific article; zbMATH DE number 177248 (Why is no real title available?)
- scientific article; zbMATH DE number 177254 (Why is no real title available?)
- scientific article; zbMATH DE number 177510 (Why is no real title available?)
- A partial approach to model checking
- Adequate proof principles for invariance and liveness properties of concurrent programs
- Automatic verification of finite-state concurrent systems using temporal logic specifications
- Decidability of Second-Order Theories and Automata on Infinite Trees
- Exponential Determinization for ω‐Automata with a Strong Fairness Acceptance Condition
- Proving Liveness Properties of Concurrent Programs
- Recognizing safety and liveness
- The complementation problem for Büchi automata with applications to temporal logic
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)
