Explicit Fair Scheduling for Dynamic Control
From MaRDI portal
Publication:5187822
DOI10.1007/978-3-642-11512-7_7zbMath1274.68035OpenAlexW1597625444MaRDI QIDQ5187822
Andreas Podelski, Ernst-Ruediger Olderog
Publication date: 9 March 2010
Published in: Concurrency, Compositionality, and Correctness (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-642-11512-7_7
Related Items (3)
Fairness for Infinitary Control ⋮ Fair Termination for Parameterized Probabilistic Concurrent Systems ⋮ Fifty years of Hoare's logic
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Proof rules and transformations dealing with fairness
- Transition Invariants and Transition Predicate Abstraction for Program Termination
- A proof rule for fair termination of guarded commands
- Guarded commands, nondeterminacy and formal derivation of programs
- Transition predicate abstraction and fair termination
- Verification: Theory and Practice
- Tools and Algorithms for the Construction and Analysis of Systems
- Static Analysis
This page was built for publication: Explicit Fair Scheduling for Dynamic Control