Hybrid automata with finite bisimulations

DOI10.1007/3-540-60084-1_85MaRDI QIDQ4645189zbMATHOpenAlexFDO

Authors 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

phase portraithybrid automatonfinite automatontransition systemfinal region

Mathematics Subject Classification ID

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

Recommendations

• Hybrid automata and bisimulations
• scientific article; zbMATH DE number 1301620
• HYBRID EXTENDED FINITE AUTOMATA
• Hybrid Extended Finite Automata
• scientific article; zbMATH DE number 1507210
• Foundations of Software Science and Computation Structures
• Denotational semantics of hybrid automata
• Bisimulation of automata
• Introduction to hybrid automata
• Hybrid Systems: Computation and Control

Cites work

• scientific article; zbMATH DE number 177515 (Why is no real title available?)
• scientific article; zbMATH DE number 1263213 (Why is no real title available?)
• scientific article; zbMATH DE number 744075 (Why is no real title available?)
• A calculus of durations
• A theory of timed automata
• CCS expressions, finite state processes, and three problems of equivalence
• On the synthesis of discrete controllers for timed systems
• Symbolic model checking for real-time systems
• The algorithmic analysis of hybrid systems
• Three Partition Refinement Algorithms

Cited in

(28)

• Equivalence checking 40 years after: a review of bisimulation tools
• scientific article; zbMATH DE number 7533351 (Why is no real title available?)
• Bisimulation for probabilistic transition systems: a coalgebraic approach
• Discrete-time control for rectangular hybrid automata
• Verification and control for probabilistic hybrid automata with finite bisimulations
• A polynomial-time algorithm for checking equivalence under certain semiring congruences motivated by the state-space isomorphism problem for hybrid systems
• Hybrid action systems
• scientific article; zbMATH DE number 3917720 (Why is no real title available?)
• From finite automata toward hybrid systems (Extended abstract)
• Finite abstractions for hybrid systems with stable continuous dynamics
• An exercise on transition systems
• Quasi-dependent variables in hybrid automata
• Modular discrete time approximations of distributed hybrid automata
• Bisimulation for probabilistic transition systems: A coalgebraic approach
• On the expressiveness and decidability of o-minimal hybrid systems
• Theory and computation of discrete state space decompositions for hybrid systems
• State equivalences for rectangular hybrid automata
• On model-checking timed automata with stopwatch observers
• Verification of Hybrid Systems
• Hybrid automata and bisimulations
• Algorithmic analysis of programs with well quasi-ordered domains.
• Well-structured transition systems everywhere!
• Model checking of systems with many identical timed processes
• Ensuring completeness of symbolic verification methods for infinite-state systems
• Uniformity for the decidability of hybrid automata
• Simulation relations and applications in formal methods
• Discrete-time control for rectangular hybrid automata
• Weighted o-minimal hybrid systems

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4645189)