Hybrid automata with finite bisimulations
From MaRDI portal
Publication:4645189
DOI10.1007/3-540-60084-1_85zbMATH Open1412.68130OpenAlexW1515514400MaRDI QIDQ4645189FDOQ4645189
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
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
Formal languages and automata (68Q45) Specification and verification (program logics, model checking, etc.) (68Q60)
Cites Work
- A theory of timed automata
- Three Partition Refinement Algorithms
- Symbolic model checking for real-time systems
- Title not available (Why is that?)
- The algorithmic analysis of hybrid systems
- CCS expressions, finite state processes, and three problems of equivalence
- On the synthesis of discrete controllers for timed systems
- Title not available (Why is that?)
- A calculus of durations
- Title not available (Why is that?)
Cited In (27)
- Theory and computation of discrete state space decompositions for hybrid systems
- On the expressiveness and decidability of o-minimal hybrid systems
- State equivalences for rectangular hybrid automata
- Modular discrete time approximations of distributed hybrid automata
- A polynomial-time algorithm for checking equivalence under certain semiring congruences motivated by the state-space isomorphism problem for hybrid systems
- Quasi-dependent variables in hybrid automata
- Hybrid automata and bisimulations
- Equivalence checking 40 years after: a review of bisimulation tools
- Discrete-time control for rectangular hybrid automata
- Finite abstractions for hybrid systems with stable continuous dynamics
- Uniformity for the decidability of hybrid automata
- Discrete-time control for rectangular hybrid automata
- Well-structured transition systems everywhere!
- Bisimulation for probabilistic transition systems: A coalgebraic approach
- Bisimulation for probabilistic transition systems: A coalgebraic approach
- Ensuring completeness of symbolic verification methods for infinite-state systems
- Verification of Hybrid Systems
- From finite automata toward hybrid systems (Extended abstract)
- Algorithmic analysis of programs with well quasi-ordered domains.
- Weighted o-minimal hybrid systems
- Title not available (Why is that?)
- Model checking of systems with many identical timed processes
- An exercise on transition systems
- Title not available (Why is that?)
- Hybrid action systems
- Simulation relations and applications in formal methods
- On model-checking timed automata with stopwatch observers
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)
