Specifications for decidable hybrid games
(2011) In Theoretical Computer Science 412(48). p.6770-6785- 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)161. We also solve the optimal-cost reachability problem for Weighted SHG and prove decidability of WCTL for Weighted STORMED hybrid systems. (C) 2011 Elsevier B.V. All rights reserved.
Please use this url to cite or link to this publication:
https://lup.lub.lu.se/record/2243215
- author
- Vladimerou, Vladimeros LU ; Prabhakar, Pavithra ; Viswanathan, Mahesh and Dullerud, Geir
- organization
- publishing date
- 2011
- type
- Contribution to journal
- publication status
- published
- subject
- keywords
- Hybrid systems, Hybrid games, Weighted CTL, Control, Verification
- in
- Theoretical Computer Science
- volume
- 412
- issue
- 48
- pages
- 6770 - 6785
- publisher
- Elsevier
- external identifiers
-
- wos:000296987400012
- scopus:80053949731
- ISSN
- 0304-3975
- DOI
- 10.1016/j.tcs.2011.08.036
- language
- English
- LU publication?
- yes
- additional info
- key=vlad_etal2011 month=November
- id
- 6cd7c20f-a29c-47b2-92e9-ff829fdb1258 (old id 2243215)
- date added to LUP
- 2016-04-01 13:41:56
- date last changed
- 2022-01-27 20:31:52
@article{6cd7c20f-a29c-47b2-92e9-ff829fdb1258, 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)161. We also solve the optimal-cost reachability problem for Weighted SHG and prove decidability of WCTL for Weighted STORMED hybrid systems. (C) 2011 Elsevier B.V. All rights reserved.}}, author = {{Vladimerou, Vladimeros and Prabhakar, Pavithra and Viswanathan, Mahesh and Dullerud, Geir}}, issn = {{0304-3975}}, keywords = {{Hybrid systems; Hybrid games; Weighted CTL; Control; Verification}}, language = {{eng}}, number = {{48}}, pages = {{6770--6785}}, publisher = {{Elsevier}}, series = {{Theoretical Computer Science}}, title = {{Specifications for decidable hybrid games}}, url = {{http://dx.doi.org/10.1016/j.tcs.2011.08.036}}, doi = {{10.1016/j.tcs.2011.08.036}}, volume = {{412}}, year = {{2011}}, }