Liveness in Timed and Untimed Systems
Authors: Roberto Segala, Rainer Gawlick, Jorgen Sogaard-Andersen, Nancy Lynch
Appears: Information and Computation, 141(2):119-171, 1998.
Also: An extended abstract appears in Proceedings of the 21st International Colloquium on Automata, Languages and Programming (ICALP), Jerusalem, Israel, LNCS 820, pages 166-177, 1994. The journal paper is a revised version of the MIT Technical Report number MIT/LCS/TR-587.
Abstract: When proving the correctness of algorithms in distributed systems, one generally considers safety conditions and liveness conditions. The Input/Output (I/O) automaton model and its timed version have been used successfully, but have focused on safety conditions and on a restricted form of liveness called fairness. In this paper we develop a new I/O automaton model, and a new timed I/O automaton model, that permit the verification of general liveness properties on the basis of existing verification techniques. Our models include a notion of environment-freedom which generalizes the idea of receptiveness of other existing formalisms, and enables the use of compositional verification techniques. The presentation includes an embedding of the untimed model into the timed model which preserves all the interesting attributes of the untimed model. Thus, our models constitute a coordinated framework for the description of concurrent and distributed systems satisfying general liveness properties.
Download the full paper from the publisher.
Download the extended abstract from the publisher.
Download the technical report.