Deciding Concurrent Planar Monotonic Linear Hybrid Systems
From MaRDI portal
Publication:2945600
DOI10.1007/978-3-319-22975-1_17zbMath1465.68198OpenAlexW2199263795MaRDI QIDQ2945600
Mahesh Viswanathan, Nima Roohi, Pavithra Prabhakar
Publication date: 14 September 2015
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-319-22975-1_17
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)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- The algorithmic analysis of hybrid systems
- A theory of timed automata
- Reachability analysis of dynamical systems having piecewise-constant derivatives
- O-minimal hybrid systems.
- A decidable class of planar linear hybrid systems
- Algorithmic analysis of polygonal hybrid systems. I: Reachability
- STORMED Hybrid Systems
- Decidable Compositions of O-Minimal Automata
- FSTTCS 2005: Foundations of Software Technology and Theoretical Computer Science
This page was built for publication: Deciding Concurrent Planar Monotonic Linear Hybrid Systems