@article{4501,
abstract = {We extend the specification language of temporal logic, the corresponding verification framework, and the underlying computational model to deal with real-;time properties of reactive systems. The abstract notion of timed transition systems generalizes traditional transition systems conservatively: qualitative fairness requirements are replaced (and superseded) by quantitative lower-bound and upper-bound timing constraints on transitions. This framework can model real-time systems that communicate either through shared variables or by message passing and real-time issues such as timeouts, process priorities (interrupts), and process scheduling. We exhibit two styles for the specification of real-time systems. While the first approach uses time-bounded versions of the temporal operators, the second approach allows explicit references to time through a special clock variable. Corresponding to the two styles of specification, we present and compare two different proof methodologies for the verification of timing requirements that are expressed in these styles. For the bounded-operator style, we provide a set of proof rules for establishing bounded-invariance and bounded-responce properties of timed transition systems. This approach generalizes the standard temporal proof rules for verifying invariance and response properties conservatively. For the explicit-clock style, we exploit the observation that every time-bounded property is a safety property and use the standard temporal proof rules for establishing safety properties.
},
author = {Thomas Henzinger and Manna, Zohar and Pnueli,Amir},
journal = {Information and Computation},
number = {2},
pages = {273 -- 337},
publisher = {Elsevier},
title = {{Temporal proof methodologies for timed transition systems}},
doi = {10.1006/inco.1994.1060},
volume = {112},
year = {1994},
}
@article{4503,
abstract = {We describe finite-state programs over real-numbered time in a guarded-command language with real-valued clocks or, equivalently, as finite automata with real-valued clocks. Model checking answers the question which states of a real-time program satisfy a branching-time specification (given in an extension of CTL with clock variables). We develop an algorithm that computes this set of states symbolically as a fixpoint of a functional on state predicates, without constructing the state space. For this purpose, we introduce a μ-calculus on computation trees over real-numbered time. Unfortunately, many standard program properties, such as response for all nonzeno execution sequences (during which time diverges), cannot be characterized by fixpoints: we show that the expressiveness of the timed μ-calculus is incomparable to the expressiveness of timed CTL. Fortunately, this result does not impair the symbolic verification of "implementable" real-time programs-those whose safety constraints are machine-closed with respect to diverging time and whose fairness constraints are restricted to finite upper bounds on clock values. All timed CTL properties of such programs are shown to be computable as finitely approximable fixpoints in a simple decidable theory.
},
author = {Thomas Henzinger and Nicollin, Xavier and Sifakis, Joseph and Yovine, Sergio},
journal = {Information and Computation},
number = {2},
pages = {193 -- 244},
publisher = {Elsevier},
title = {{Symbolic model checking for real-time systems}},
doi = {10.1006/inco.1994.1045},
volume = {111},
year = {1994},
}
@inproceedings{4586,
abstract = {Fairness is a mathematical abstraction: in a multiprogramming environment, fairness abstracts the details of admissible (“fair”) schedulers; in a distributed environment, fairness abstracts the speeds of independent processors. We argue that the standard definition of fairness often is unnecessarily weak and can be replaced by the stronger, yet still abstract, notion of finitary fairness. While standard weak fairness requires that no enabled transition is postponed forever, finitary weak fairness requires that for every run of a system there is an unknown bound k such that no enabled transition is postponed more than k consecutive times. In general, the finitary restriction fin(F) of any given fairness assumption F is the union of all w-regular safety properties that are contained in F. The adequacy of the proposed abstraction is demonstrated in two ways. Suppose that we prove a program property under the assumption of finitary fairness. In a multiprogramming environment, the program then satisfies the property for all fair finite-state schedulers. In a distributed environment, the program then satisfies the property for all choices of lower and upper bounds on the speeds (or timings) of processors},
author = {Alur, Rajeev and Thomas Henzinger},
pages = {52 -- 61},
publisher = {IEEE},
title = {{Finitary fairness}},
doi = {10.1109/LICS.1994.316087 },
year = {1994},
}
@inbook{4590,
abstract = {We introduce a temporal logic for the specification of real-time systems. Our logic, TPTL, employs a novel quantifier construct for referencing time: the "freeze" quantifier binds a variable to the time of the local temporal context. TPTL is both a natural language for specification and a suitable formalism for verification. We present a tableau-based decision procedure and a model-checking algorithm for TPTL. Several generalizations of TPTL are shown to be highly undecidable.},
author = {Alur, Rajeev and Thomas Henzinger},
booktitle = {Theories and Experiences for Real-Time System Development},
editor = {Rus, Teodor and Rattray,Charles},
pages = {1 -- 29},
publisher = {World Scientific Publishing},
title = {{Real-time system = discrete system + clock variables}},
volume = {2},
year = {1994},
}
@article{4591,
abstract = {We introduce a temporal logic for the specification of real-time systems. Our logic, TPTL, employs a novel quantifier construct for referencing time: the freeze quantifier binds a variable to the time of the local temporal context. TPTL is both a natural language for specification and a suitable formalism for verification. We present a tableau-based decision procedure and a model-checking algorithm for TPTL. Several generalizations of TPTL are shown to be highly undecidable.},
author = {Alur, Rajeev and Thomas Henzinger},
journal = {Journal of the ACM},
number = {1},
pages = {181 -- 204},
publisher = {ACM},
title = {{A really temporal logic}},
doi = {10.1145/174644.174651},
volume = {41},
year = {1994},
}