Specifications for decidable hybrid games
DOI10.1016/J.TCS.2011.08.036zbMATH Open1229.93104OpenAlexW2154908821MaRDI QIDQ650914FDOQ650914
Authors: Vladimeros Vladimerou, Pavithra Prabhakar, Mahesh Viswanathan, Geir E. Dullerud
Publication date: 7 December 2011
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2011.08.036
Recommendations
Formal languages and automata (68Q45) Applications of game theory (91A80) Control/observation systems governed by functional relations other than differential equations (such as hybrid and switching systems) (93C30)
Cites Work
- On the real exponential field with restricted analytic functions
- O-minimal hybrid systems.
- Title not available (Why is that?)
- Title not available (Why is that?)
- Conflict resolution for air traffic management: a study in multiagent hybrid systems
- Minimum-Time Reachability in Timed Games
- Title not available (Why is that?)
- Linear Time Logic Control of Discrete-Time Linear Systems
- Title not available (Why is that?)
- On the synthesis of discrete controllers for timed systems
- Title not available (Why is that?)
- Discrete-time control for rectangular hybrid automata
- Title not available (Why is that?)
- STORMED Hybrid Systems
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Formal Techniques, Modelling and Analysis of Timed and Fault-Tolerant Systems
- Bisimulation relations for dynamical, control, and hybrid systems
- Controller synthesis for bisimulation equivalence
- Computing Differential Invariants of Hybrid Systems as Fixedpoints
- Hierarchical Synthesis of Hybrid Controllers from Temporal Logic Specifications
- Title not available (Why is that?)
- On the expressiveness and decidability of o-minimal hybrid systems
- Weighted O-Minimal Hybrid Systems Are More Decidable Than Weighted Timed Automata!
- Weighted o-minimal hybrid systems
- Reachability and optimal control for linear hybrid automata: a quantifier elimination approach
- STORMED Hybrid Games
- Title not available (Why is that?)
- Successive Abstractions of Hybrid Automata for Monotonic CTL Model Checking
Cited In (5)
This page was built for publication: Specifications for decidable hybrid games
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q650914)