@misc{4289,
abstract = {A worldwide survey of polymorphic molecular markers shows that the human population is genetically homogeneous, in close agreement with evidence from quite different genes and traits.},
author = {Nicholas Barton},
booktitle = {Current Biology},
number = {12},
pages = {757 -- 758},
publisher = {Cell Press},
title = {{Population genetics: A new apportionment of human diversity}},
doi = {10.1016/S0960-9822(06)00397-6},
volume = {7},
year = {1997},
}
@misc{4290,
author = {Nicholas Barton},
booktitle = {Genetical Research},
number = {2},
pages = {178 -- 180},
publisher = {Cambridge University Press},
title = {{Natural hybridization and evolution}},
volume = {70},
year = {1997},
}
@misc{4291,
author = {Nicholas Barton},
booktitle = {Genetical Research},
number = {2},
pages = {180 -- 181},
publisher = {Cambridge University Press},
title = {{The ccological detective: Confronting models with data}},
volume = {70},
year = {1997},
}
@inbook{4293,
abstract = {Natural populations differ from the simplest models in ways which can significantly affect their evolution. Real populations are rarely all of the same size; the rates of migration into and out of populations vary in space and time; some populations go extinct, and new ones are established, while all populations fluctuate in size. Furthermore, the genetic properties of real species are not like those assumed in simple models. Alleles are exposed to a wide variety of selection mutation rarely creates novel genotypes with each mutation event, generations overlap, and environments vary from place to place. Evolution in a metapopulation can be substantially different from the predictions of single-population models and, indeed, very different from the simplest models of subdivided species.},
author = {Nicholas Barton and Whitlock, Michael},
booktitle = {Metapopulation Biology},
pages = {183 -- 210},
publisher = {Academic Press},
title = {{The evolution of metapopulations}},
doi = {10.1016/B978-012323445-2/50012-2},
year = {1997},
}
@inproceedings{4438,
abstract = {In temporal-logic model checking, we verify the correctness of a program with respect to a desired behavior by checking whether a structure that models the program satisfies a temporal-logic formula that specifies the behavior. The model-checking problem for the branching-time temporal logic CTL can be solved in linear running time, and model-checking tools for CTL are used successfully in industrial applications. The development of programs that must meet rigid real-time constraints has brought with it a need for real-time temporal logics that enable quantitative reference to time. Early research on real-time temporal logics uses the discrete domain of the integers to model time. Present research on real-time temporal logics focuses on continuous time and uses the dense domain of the reals to model time. There, model checking becomes significantly more complicated. For example, the model-checking problem for TCTL, a continuous-time extension of the logic CTL, is PSPACE-complete.
In this paper we suggest a reduction from TCTL model checking to CTL model checking. The contribution of such a reduction is twofold. Theoretically, while it has long been known that model-checking methods for untimed temporal logics can be extended quite easily to handle discrete time, it was not clear whether and how untimed methods can handle the reset quantifier of TCTL, which resets a realvalued clock. Practically, our reduction enables anyone who has a tool for CTL model checking to use it for TCTL model checking. The TCTL model-checking algorithm that follows from our reduction is in PSPACE, matching the known bound for this problem. In addition, it enjoys the wide distribution of CTL model-checking tools and the extensive and fruitful research efforts and heuristics that have been put into these tools.},
author = {Thomas Henzinger and Kupferman, Orna},
pages = {48 -- 62},
publisher = {Springer},
title = {{From quantity to quality}},
doi = { 10.1007/BFb0014712},
volume = {1201},
year = {1997},
}
@inproceedings{4441,
abstract = {Rectangular hybrid automata model digital control programs of analog plant environments. We study rectangular hybrid automata where the plant state evolves continuously in real-numbered time, and the controller samples the plant state and changes the control state discretely, only at the integer points in time. We prove that rectangular hybrid automata have finite bisimilarity quotients when all control transitions happen at integer times, even if the constraints on the derivatives of the variables vary between control states. This is sharply in contrast with the conventional model where control transitions may happen at any real time, and already the reachability problem is undecidable. Based on the finite bisimilarity quotients, we give an exponential algorithm for the symbolic sampling-controller synthesis of rectangular automata. We show our algorithm to be optimal by proving the problem to be EXPTIME-hard. We also show that rectangular automata form a maximal class of systems for which the sampling-controller synthesis problem can be solved algorithmically.},
author = {Thomas Henzinger and Kopke, Peter W},
pages = {582 -- 593},
publisher = {Springer},
title = {{Discrete-time control for rectangular hybrid automata}},
doi = {10.1007/3-540-63165-8_213},
volume = {1256},
year = {1997},
}
@inproceedings{4520,
abstract = {We define robust timed automata, which are timed automata that accept all trajectories robustly: if a robust timed automaton accepts a trajectory, then it must accept neighboring trajectories also; and if a robust timed automaton rejects a trajectory, then it must reject neighboring trajectories also. We show that the emptiness problem for robust timed automata is still decidable, by modifying the region construction for timed automata. We then show that, like timed automata, robust timed automata cannot be determinized. This result is somewhat unexpected, given that in temporal logic, the removal of realtime equality constraints is known to lead to a decidable theory that is closed under all boolean operations.},
author = {Gupta, Vineet and Thomas Henzinger and Jagadeesan, Radha},
pages = {331 -- 345},
publisher = {Springer},
title = {{Robust timed automata}},
doi = {10.1007/BFb0014736},
volume = {1201},
year = {1997},
}
@article{4493,
author = {Thomas Henzinger and Ho, Pei-Hsin and Wong-Toi, Howard},
journal = {Software Tools For Technology Transfer},
number = {1-2},
pages = {110 -- 122},
publisher = {Springer},
title = {{HyTech: A model checker for hybrid systems}},
doi = {10.1007/s100090050008},
volume = {1},
year = {1997},
}
@inproceedings{4494,
abstract = {A hybrid system consists of a collection of digital programs that interact with each other and with an analog environment. Examples of hybrid systems include medical equipment, manufacturing controllers, automotive controllers, and robots. The formal analysis of the mixed digital-analog nature of these systems requires a model that incorporates the discrete behavior of computer programs with the continuous behavior of environment variables, such as temperature and pressure. Hybrid automata capture both types of behavior by combining finite automata with differential inclusions (i.e. differential inequalities). HyTech is a symbolic model checker for linear hybrid automata, an expressive, yet automatically analyzable, subclass of hybrid automata. A key feature of HyTech is its ability to perform parametric analysis, i.e. to determine the values of design parameters for which a linear hybrid automaton satisfies a temporal requirement.},
author = {Thomas Henzinger and Ho, Pei-Hsin and Wong-Toi, Howard},
pages = {460 -- 463},
publisher = {Springer},
title = {{HyTech: A model checker for hybrid systems}},
doi = {10.1007/3-540-63166-6_48},
volume = {1254},
year = {1997},
}
@inproceedings{4496,
abstract = {The simulation preorder for labeled transition systems is defined locally as a game that relates states with their immediate successor states. Liveness assumptions about transition systems are typically modeled using fairness constraints. Existing notions of simulation for fair transition systems, however, are not local, and as a result, many appealing properties of the simulation preorder are lost. We extend the local definition of simulation to account for fairness: system S fairly simulates system I iff in the simulation game, there is a strategy that matches with each fair computation of I a fair computation of S. Our definition enjoys a fully abstract semantics and has a logical characterization: S fairly simulates I iff every fair computation tree embedded in the unrolling of I can be embedded also in the unrolling of S or, equivalently, iff every Fair-AFMC formula satisfied by I is satisfied also by S (AFMC is the universal fragment of the alternation-free -calculus). The locality of the definition leads us to a polynomial-time algorithm for checking fair simulation for finite-state systems with weak and strong fairness constraints. Finally, fair simulation implies fair trace-containment, and is therefore useful as an efficientlycomputable local criterion for proving linear-time abstraction hierarchies.},
author = {Thomas Henzinger and Kupferman, Orna and Rajamani, Sriram K},
pages = {273 -- 287},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum für Informatik},
title = {{Fair simulation}},
doi = {10.1007/3-540-63141-0_19},
volume = {1243},
year = {1997},
}