Hybrid automata with finite bisimulations

DOI10.1007/3-540-60084-1_85zbMath1412.68130OpenAlexW1515514400MaRDI QIDQ4645189

Thomas A. Henzinger

Publication date: 10 January 2019

Published in: Automata, Languages and Programming (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/3-540-60084-1_85

zbMATH Keywords

finite automatontransition systemphase portraithybrid automatonfinal region

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Specification and verification (program logics, model checking, etc.) (68Q60)

Related Items (22)

Verification of Hybrid Systems ⋮ On the expressiveness and decidability of o-minimal hybrid systems ⋮ Theory and computation of discrete state space decompositions for hybrid systems ⋮ Simulation relations and applications in formal methods ⋮ Modular discrete time approximations of distributed hybrid automata ⋮ State equivalences for rectangular hybrid automata ⋮ Equivalence checking 40 years after: a review of bisimulation tools ⋮ Weighted o-minimal hybrid systems ⋮ Bisimulation for probabilistic transition systems: A coalgebraic approach ⋮ Discrete-time control for rectangular hybrid automata ⋮ Well-structured transition systems everywhere! ⋮ Ensuring completeness of symbolic verification methods for infinite-state systems ⋮ On model-checking timed automata with stopwatch observers ⋮ Unnamed Item ⋮ A polynomial-time algorithm for checking equivalence under certain semiring congruences motivated by the state-space isomorphism problem for hybrid systems ⋮ Bisimulation for probabilistic transition systems: A coalgebraic approach ⋮ Discrete-time control for rectangular hybrid automata ⋮ Model checking of systems with many identical timed processes ⋮ Hybrid action systems ⋮ Algorithmic analysis of programs with well quasi-ordered domains. ⋮ An Exercise on Transition Systems ⋮ Uniformity for the decidability of hybrid automata

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• The algorithmic analysis of hybrid systems
• CCS expressions, finite state processes, and three problems of equivalence
• A calculus of durations
• A theory of timed automata
• Symbolic model checking for real-time systems
• Three Partition Refinement Algorithms
• On the synthesis of discrete controllers for timed systems

This page was built for publication: Hybrid automata with finite bisimulations