Abstract
We introduce STORMED hybrid games (SHG), a generalization of STORMED hybrid systems, Vladimerou et al. (2008) [33], which have natural specifications that allow rich continuous dynamics and various decidable properties. We solve the control problem for SHG using a reduction to bisimulation on finite game graphs. This generalizes to a greater family of games, which includes o-minimal hybrid games, Bouyer et al. (2006) [6]. We also solve the optimal-cost reachability problem for Weighted SHG and prove decidability of WCTL for Weighted STORMED hybrid systems.
| Original language | English (US) |
|---|---|
| Pages (from-to) | 6770-6785 |
| Number of pages | 16 |
| Journal | Theoretical Computer Science |
| Volume | 412 |
| Issue number | 48 |
| DOIs | |
| State | Published - Nov 11 2011 |
Keywords
- Control
- Hybrid games
- Hybrid systems
- Verification
- Weighted CTL
ASJC Scopus subject areas
- Theoretical Computer Science
- Computer Science(all)