Deciding concurrent planar monotonic linear hybrid systems
From MaRDI portal
(Redirected from Publication:2945600)
Formal languages and automata (68Q45) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85) Control/observation systems governed by functional relations other than differential equations (such as hybrid and switching systems) (93C30)
Recommendations
Cites work
- A decidable class of planar linear hybrid systems
- A theory of timed automata
- Algorithmic analysis of polygonal hybrid systems. I: Reachability
- Decidable Compositions of O-Minimal Automata
- FSTTCS 2005: Foundations of Software Technology and Theoretical Computer Science
- scientific article; zbMATH DE number 1263213 (Why is no real title available?)
- scientific article; zbMATH DE number 1160037 (Why is no real title available?)
- scientific article; zbMATH DE number 1507210 (Why is no real title available?)
- scientific article; zbMATH DE number 1444359 (Why is no real title available?)
- O-minimal hybrid systems.
- Reachability analysis of dynamical systems having piecewise-constant derivatives
- STORMED Hybrid Systems
- The algorithmic analysis of hybrid systems
Cited in
(3)
This page was built for publication: Deciding concurrent planar monotonic linear hybrid systems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2945600)