Proving the Existence of Fair Paths in Infinite-State Systems
Abstract elided by the publisher.
Related papers
- Fairness for Infinite-State Systems TACAS 2015
- Searching for Ribbon-Shaped Paths in Fair Transition Systems TACAS 2022
- Fair Termination for Parameterized Probabilistic Concurrent Systems TACAS 2017
- Reducing liveness to safety in first-order logic POPL 2018
- Proving Liveness for Networks of Communicating Finite State Machines TOPLAS 1986
- Automatic Synthesis of Smooth Infinite Horizon Paths Satisfying Linear Temporal Logic Specifications CAV 2025
- On Automation of CTL* Verification for Infinite-State Systems CAV 2015
- Deducing Fairness Properties in UNITY Logic - A New Completeness Result TOPLAS 1995