Polynomial fairness and liveness (original) (raw)

2002, Proceedings 15th IEEE Computer Security Foundations Workshop. CSFW-15

Guarded Protocols with Fairness

2015

Guarded protocols were introduced in a seminal paper by Emerson and Kahlon (2000), and describe systems of processes whose transitions are enabled or disabled depending on the existence of other processes in certain local states. We study parameterized model check- ing and synthesis of guarded protocols, both aiming at formal correctness arguments for systems with any number of processes. Cuto results re- duce reasoning about systems with an arbitrary number of processes to systems of a determined, xed size. Our work stems from the observa- tion that existing cuto results for guarded protocols i) are restricted to closed systems, and ii) are of limited use for liveness properties because reductions do not preserve fairness. We close these gaps and obtain new cuto results for open systems with liveness properties under fairness assumptions. Furthermore, we obtain cutos for the detection of global and local deadlocks, which are of paramount importance in synthesis. Finally, we prove t...

Loading...

Loading Preview

Sorry, preview is currently unavailable. You can download the paper by clicking the button above.