scientific article; zbMATH DE number 1263213

Anuj Puri, Peter W. Kopke, Pravin P. Varaiya, Thomas A. Henzinger

Publication date: 27 January 2002

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

Related Items (63)

Differential Game Logic ⋮ Algorithmic analysis of polygonal hybrid systems. I: Reachability ⋮ Model measuring for discrete and hybrid systems ⋮ Discrete semantics for hybrid automata. Avoiding misleading assumptions in systems biology ⋮ Model Checking of Biological Systems ⋮ On the optimal reachability problem of weighted timed automata ⋮ Modeling and analysis using hybrid Petri nets ⋮ On the decidability and complexity of problems for restricted hierarchical hybrid systems ⋮ Decidable hybrid systems ⋮ HySAT: An efficient proof engine for bounded model checking of hybrid systems ⋮ Reachability problems and abstract state spaces for time Petri nets with stopwatches ⋮ Deciding Concurrent Planar Monotonic Linear Hybrid Systems ⋮ Automatic synthesis of switching controllers for linear hybrid systems: safety control ⋮ Formal Modelling, Analysis and Verification of Hybrid Systems ⋮ A survey of timed automata for the development of real-time systems ⋮ Hybrid automata-based CEGAR for rectangular hybrid systems ⋮ The power of reachability testing for timed automata ⋮ Asynchronous correspondences between hybrid trajectory semantics ⋮ Low dimensional hybrid systems -- decidable, undecidable, don't know ⋮ State equivalences for rectangular hybrid automata ⋮ The Birth of Model Checking ⋮ Switching controller synthesis for delay hybrid systems under perturbations ⋮ Abstractions Refinement for Hybrid Systems Diagnosability Analysis ⋮ Weighted o-minimal hybrid systems ⋮ STORMED Hybrid Systems ⋮ Discrete-time control for rectangular hybrid automata ⋮ Specifications for decidable hybrid games ⋮ Control: a perspective ⋮ Decidable Compositions of O-Minimal Automata ⋮ HYPE: hybrid modelling by composition of flows ⋮ \(\epsilon\)-semantics computations on biological systems ⋮ Cancer hybrid automata: model, beliefs and therapy ⋮ Counterexample-Guided Refinement of Template Polyhedra ⋮ Semi-formal verification of the steady state behavior of mixed-signal circuits by SAT-based property checking ⋮ Hybrid Automata in Systems Biology: How Far Can We Go? ⋮ Hybrid automata with finite bisimulations ⋮ Model Checking the Quantitative μ-Calculus on Linear Hybrid Systems ⋮ Algorithmic analysis of polygonal hybrid systems. II: Phase portrait and tools ⋮ A decidable class of planar linear hybrid systems ⋮ Hybrid automata, reachability, and systems biology ⋮ A survey of challenges for runtime verification from advanced application domains (beyond software) ⋮ Deciding stability and mortality of piecewise affine dynamical systems ⋮ On model-checking timed automata with stopwatch observers ⋮ Symbolic reachability computation for families of linear vector fields ⋮ Challenges in Constraint-Based Analysis of Hybrid Systems ⋮ A polynomial-time algorithm for checking equivalence under certain semiring congruences motivated by the state-space isomorphism problem for hybrid systems ⋮ Inclusion dynamics hybrid automata ⋮ Falsification of LTL Safety Properties in Hybrid Systems ⋮ Periodically Controlled Hybrid Systems ⋮ STORMED Hybrid Games ⋮ Supervisory target control for hybrid systems ⋮ Straightening out rectangular differential inclusions ⋮ Approximated Reachability on Hybrid Automata: Falsification meets Certification ⋮ Hybrid systems: From verification to falsification by combining motion planning and discrete search ⋮ Formal analysis of the Schulz matrix inversion algorithm: a paradigm towards computer aided verification of general matrix flow solvers ⋮ Theorem of abstraction for equivalent controllers in hybrid systems ⋮ Timed automata and additive clock constraints ⋮ Discrete-time control for rectangular hybrid automata ⋮ Product interval automata ⋮ Decidable integration graphs. ⋮ Parameter synthesis of polynomial dynamical systems ⋮ Zone-based verification of timed automata: extrapolations, simulations and what next? ⋮ Uniformity for the decidability of hybrid automata

This page was built for publication: