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
(29)- Theory and computation of discrete state space decompositions for hybrid systems
- On the expressiveness and decidability of o-minimal hybrid systems
- Verification and control for probabilistic hybrid automata with finite bisimulations
- Modular discrete time approximations of distributed hybrid automata
- State equivalences for rectangular 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
- Finite abstractions for hybrid systems with stable continuous dynamics
- Discrete-time control for rectangular hybrid automata
- Equivalence checking 40 years after: a review of bisimulation tools
- 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
- scientific article; zbMATH DE number 3917720 (Why is no real title available?)
- Model checking of systems with many identical timed processes
- An exercise on transition systems
- Trigger-based discretization of hybrid games for autonomous cyber-physical systems
- scientific article; zbMATH DE number 7533351 (Why is no real title available?)
- Hybrid action systems
- On model-checking timed automata with stopwatch observers
- Simulation relations and applications in formal methods
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)
