Uniformity for the decidability of hybrid automata
From MaRDI portal
Publication:5030200
Recommendations
- FSTTCS 2005: Foundations of Software Technology and Theoretical Computer Science
- scientific article; zbMATH DE number 6741931
- scientific article; zbMATH DE number 1927563
- Hybrid automata and bisimulations
- Reachability Problems for Hybrid Automata
- On concrete characterization of universal hypergraphic automata
- Unifying Equivalences for Higher Dimensional Automata
- Discretizing affine hybrid automata with uncertainty
- scientific article; zbMATH DE number 4100618
- Hybrid automata with finite bisimulations
Cites work
- Decidable integration graphs.
- scientific article; zbMATH DE number 176728 (Why is no real title available?)
- scientific article; zbMATH DE number 1263213 (Why is no real title available?)
- scientific article; zbMATH DE number 526071 (Why is no real title available?)
- scientific article; zbMATH DE number 744075 (Why is no real title available?)
- Hybrid automata with finite bisimulations
- Symbolic model checking for real-time systems
Cited in
(5)- Decidability of verification of safety properties of spatial families of linear hybrid automata
- What's decidable about recursive hybrid automata?
- scientific article; zbMATH DE number 1927563 (Why is no real title available?)
- scientific article; zbMATH DE number 6741931 (Why is no real title available?)
- Monitoring of dynamic processes by rectangular hybrid automata
This page was built for publication: Uniformity for the decidability of hybrid automata
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5030200)