Time-annotated game graphs for synthesis from abstracted systems
- Creators
- Livingston, Scott C.
Abstract
The construction of discrete abstractions is a crucial part of many methods for control synthesis of hybrid systems subject to formal specifications. In general, the product of discrete abstractions may not be a discrete abstraction for the product of the underlying continuously-valued systems. Addressing this, we present a control synthesis method for transition systems that are built from components with uncertain timing characteristics. The new device, called here time-annotated game graphs, is demonstrated in a variety of examples. While it is applicable generally to parity games, we consider it in the context of control subject to GR(1) specifications. We show how a nominal strategy obtained without time knowledge can be modified to recover correctness when time information becomes available. The methods are applied to a brief case study of an aircraft electric power system.
Additional Information
This is an extended version of a paper to be presented at the IEEE Conference on Decision and Control (CDC) in Osaka, Japan, on 15-18 December 2015. The author thanks Richard M. Murray for motivating discussions. This work was partially supported by United Technologies Corporation and IBM, through the industrial cyber-physical systems (iCyPhy) consortium.Attached Files
Submitted - spectolerance-cdc2015tr.pdf
Files
Name | Size | Download all |
---|---|---|
md5:1a9528cae9f9a539e6353e85f579a229
|
568.7 kB | Preview Download |
Additional details
- Eprint ID
- 60312
- Resolver ID
- CaltechCDSTR:2015.005
- United Technologies Corporation
- IBM Corp.
- iCyPhy Consortium
- Created
-
2015-09-18Created from EPrint's datestamp field
- Updated
-
2019-10-03Created from EPrint's last_modified field
- Caltech groups
- Control and Dynamical Systems Technical Reports