Pages that link to "Item:Q795499"
From MaRDI portal
The following pages link to Fair termination revisited - with delay (Q795499):
Displaying 14 items.
- Complete proof rules for strong fairness and strong extreme fairness (Q685427) (← links)
- A complete rule for equifair termination (Q1088401) (← links)
- Deadlock and fairness in morphisms of transition systems (Q1105379) (← links)
- Infinite trees, markings, and well-foundedness (Q1112586) (← links)
- Temporal predicate transformers and fair termination (Q1120264) (← links)
- The \(\mu\)-calculus as an assertion-language for fairness arguments (Q1124314) (← links)
- A methodology for designing proof rules for fair parallel programs (Q1377299) (← links)
- Verification of concurrent programs: The automata-theoretic framework (Q2277249) (← links)
- Fifty years of Hoare's logic (Q2280214) (← links)
- Communicating processes, scheduling, and the complexity of nontermination (Q3034829) (← links)
- Fair termination is decidable for ground systems (Q5055739) (← links)
- Fairness and Correctness in Case of a Premature Abort (Q5450999) (← links)
- Semantic models for total correctness and fairness (Q5887518) (← links)
- Liminf progress measures (Q6171780) (← links)
