@inbook{4307,
author = {Nicholas Barton},
booktitle = {Animal dispersal: small mammals as a model},
editor = {Stenseth, Nils C and Lidicker, William Z},
pages = {37 -- 60},
publisher = {Chapman Hall},
title = {{The genetic consequences of dispersal}},
year = {1992},
}
@article{4308,
author = {Nicholas Barton},
journal = {Evolution; International Journal of Organic Evolution},
number = {2},
pages = {551 -- 557},
publisher = {Wiley-Blackwell},
title = {{On the spread of new gene combinations in the third phase of Wright's shifting balance}},
volume = {46},
year = {1992},
}
@inproceedings{4504,
author = {Thomas Henzinger and Manna, Zohar and Pnueli,Amir},
pages = {545 -- 558},
publisher = {Springer},
title = {{What good are digital clocks?}},
doi = {10.1007/3-540-55719-9_103},
volume = {623},
year = {1992},
}
@inproceedings{4505,
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 mu-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 mu-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},
pages = {394 -- 406},
publisher = {IEEE},
title = {{Symbolic model checking for real-time systems}},
doi = {10.1109/LICS.1992.185551},
year = {1992},
}
@inbook{4507,
abstract = {We incorporate time into an interleaving model of concurrency. In timed transition systems, the qualitative fairness requirements of traditional transition system are replaced (and superseded) by quantitative lower-bound and upperbound timing constraints on transitions. The purpose of this paper is to explore the scope of applicability for the abstract model of timed transition systems. We demonstrate that the model can represent a wide variety of phenomena that routinely occur in conjunction with the timed execution of concurrent processes. Our treatment covers both processes that are executed in parallel on separate processors and communicate either through shared variables or by message passing, and processes that time-share a limited number of processors under a given scheduling policy. Often it is this scheduling policy that determines if a system meets its real-time requirements. Thus we explicitly address such questions as time-outs, interrupts, static and dynamic priorities.},
author = {Thomas Henzinger and Manna, Zohar and Pnueli,Amir},
booktitle = {Real Time: Theory in Practice},
pages = {226 -- 251},
publisher = {Springer},
title = {{Timed transition systems}},
doi = {10.1007/BFb0031995},
volume = {600},
year = {1992},
}
@article{4517,
abstract = {It has been observed repeatedly that the standard safety-liveness classification for properties of reactive systems does not fit for real-time properties. This is because the implicit “liveliness” of time shifts the spectrum towards the safety side. While, for example, response—that “something good” will happen eventually—is a classical liveness property, bounded response—that “something good” will happen soon, within a certain amount of time—has many characteristics of safety. We account for this phenomenon formally by defining safety and liveness relative to a given condition, such as the progress of time.},
author = {Thomas Henzinger},
journal = {Information Processing Letters},
number = {3},
pages = {135 -- 141},
publisher = {Elsevier},
title = {{Sooner Is Safer Than Later}},
doi = {10.1016/0020-0190(92)90005-G},
volume = {43},
year = {1992},
}
@inbook{4593,
abstract = {We survey logic-based and automata-based languages and techniques for the specification and verification of real-time systems. In particular, we discuss three syntactic extensions of temporal logic: time-bounded operators, freeze quantification, and time variables. We also discuss the extension of finite-state machines with clocks and the extension of transition systems with time bounds on the transitions. All of the resulting notations can be interpreted over a variety of different models of time and computation, including linear and branching time, interleaving and true concurrency, discrete and continuous time. For each choice of syntax and semantics, we summarize the results that are known about expressive power, algorithmic finite-state verification, and deductive verification.},
author = {Alur, Rajeev and Thomas Henzinger},
booktitle = {Real Time: Theory in Practice},
pages = {74 -- 106},
publisher = {Springer},
title = {{Logics and models of real time: A survey}},
doi = {10.1007/BFb0031984},
volume = {600},
year = {1992},
}
@inproceedings{4594,
abstract = {The authors introduce two-way timed automata-timed automata that can move back and forth while reading a timed word. Two-wayness in its unrestricted form leads, like nondeterminism, to the undecidability of language inclusion. However, if they restrict the number of times an input symbol may be revisited, then two-wayness is both harmless and desirable. The authors show that the resulting class of bounded two-way deterministic timed automata is closed under all boolean operations, has decidable (PSPACE-complete) emptiness and inclusion problems, and subsumes all decidable real-time logics we know. They obtain a strict hierarchy of real-time properties: deterministic timed automata can accept more languages as the bound on the number of times an input symbol may be revisited is increased. This hierarchy is also enforced by the number of alternations between past and future operators in temporal logic. The combination of the results leads to a decision procedure for a real-time logic with past operators
},
author = {Alur, Rajeev and Thomas Henzinger},
pages = {177 -- 186},
publisher = {IEEE},
title = {{Back to the future: Towards a theory of timed regular languages}},
doi = {10.1109/SFCS.1992.267774},
year = {1992},
}
@article{2714,
author = {László Erdös},
journal = {Acta Mathematica Hungarica},
number = {1-2},
pages = {11 -- 24},
publisher = {Springer},
title = {{On some problems of P. Turán concerning power sums of complex numbers}},
doi = {10.1007/BF00052086},
volume = {59},
year = {1992},
}
@article{2722,
abstract = {A version of the one-dimensional Rayleigh gas is considered: a point particle of mass M (molecule), confined to the unit interval [0,1], is surrounded by an infinite ideal gas of point particles of mass 1 (atoms). The molecule interacts with the atoms and with the walls via elastic collision. Central limit theorems are proved for a wide class of additive functionals of this system (e.g. the number of collisions with the walls and the total length of the molecular path).},
author = {László Erdös and Tuyen, Dao Quang},
journal = {Communications in Mathematical Physics},
number = {3},
pages = {451 -- 466},
publisher = {Springer},
title = {{Central limit theorems for the one-dimensional Rayleigh gas with semipermeable barriers}},
doi = {10.1007/BF02099260},
volume = {143},
year = {1992},
}