@inproceedings{4602,
  abstract     = {Modular techniques for automatic verification attempt to overcome the state-explosion problem by exploiting the modular structure naturally present in many system designs. Unlike other tasks in the verification of finite-state systems, current modular techniques rely heavily on user guidance. In particular, the user is typically required to construct module abstractions that are neither too detailed as to render insufficient benefits in state exploration, nor too coarse as to invalidate the desired systemproperties. In this paper, we construct abstractmodules automatically, using reachability and controllability information about the concrete modules. This allows us to leverage automatic verification techniques by applying them in layers: first we compute on the state spaces of system components, then we use the results for constructing abstractions, and finally we compute on the abstract state space of the system. Our experimental results indicate that if reachability and controllability information is used in the construction of abstractions, the resulting abstract modules are often significantly smaller than the concrete modules and can drastically reduce the space and time requirements for verification.},
  author       = {Alur, Rajeev and De Alfaro, Luca and Henzinger, Thomas A and Mang, Freddy},
  booktitle    = {Proceedings of the 10th International Conference on Concurrency Theory},
  isbn         = {9783540664253},
  location     = {Eindhoven, The Netherlands},
  pages        = {82 -- 97},
  publisher    = {Schloss Dagstuhl - Leibniz-Zentrum für Informatik},
  title        = {{Automating modular verification}},
  doi          = {10.1007/3-540-48320-9_8},
  volume       = {1664},
  year         = {1999},
}

@inproceedings{4485,
  abstract     = {In order to study control problems for hybrid systems, we generalize hybrid automata to hybrid games —say, controller vs. plant. If we specify the continuous dynamics by constant lower and upper bounds, we obtain rectangular games. We show that for rectangular games with objectives expressed in Ltl (linear temporal logic), the winning states for each player can be computed, and winning strategies can be synthesized. Our result is sharp, as already reachability is undecidable for generalizations of rectangular systems, and optimal —singly exponential in the size of the game structure and doubly exponential in the size of the Ltl objective. Our proof systematically generalizes the theory of hybrid systems from automata (single-player structures) [9] to games (multi-player structures): we show that the successively more general infinite-state classes of timed, 2D rectangular, and rectangular games induce successively weaker, but still finite, quotient structures called game bisimilarity, game similarity, and game trace equivalence. These quotients can be used, in particular, to solve the Ltl control problem.},
  author       = {Henzinger, Thomas A and Horowitz, Benjamin and Majumdar, Ritankar},
  booktitle    = {Proceedings of the 10th International Conference on Concurrency Theory},
  isbn         = {9783540664253},
  location     = {Eindhoven, The Netherlands},
  pages        = {320 -- 335},
  publisher    = {Schloss Dagstuhl - Leibniz-Zentrum für Informatik},
  title        = {{Rectangular hybrid games}},
  doi          = {10.1007/3-540-48320-9_23},
  volume       = {1664},
  year         = {1999},
}