Results

**11 - 14**of**14**### Synthesis and Validation of Control Software For A Vehicular Electric Power Distribution Testbed

"... Modern aircraft increasing rely on electric power, resulting in high safety-criticality and complexity in their electric power generation and distribution systems. Moti-vated by the resulting rapid increase in the costs and duration of the design cycles for such systems, we investigate the use of fo ..."

Abstract
- Add to MetaCart

(Show Context)
Modern aircraft increasing rely on electric power, resulting in high safety-criticality and complexity in their electric power generation and distribution systems. Moti-vated by the resulting rapid increase in the costs and duration of the design cycles for such systems, we investigate the use of formal specification and automated, correct-by-construction control protocols synthesis for primary distribution in vehicular electric power networks. We discuss a design workflow that aims to transition from the tra-ditional “design+verify ” approach to a “specify+synthesize ” approach. We give an overview of a subset of the recent advances in the synthesis of reactive control proto-cols. We apply these techniques in the context of reconfiguration of the networks in reaction to the changes in their operating environment. We also validate these auto-matically synthesized control protocols on high-fidelity simulation models and on an academic-scale hardware testbed. 1 I.

### Automated Synthesis of Controllers for Search and Rescue from Temporal Logic Specifications

, 2014

"... ar ..."

(Show Context)
### DRAFT 1 Synthesis of Reactive Switching Protocols from Temporal Logic Specifications

, 2012

"... We propose formal means for synthesizing switching protocols that determine the sequence in which the modes of a switched system are activated to satisfy certain high-level specifications in linear temporal logic (LTL). The synthesized protocols are robust against exogenous disturbances on the conti ..."

Abstract
- Add to MetaCart

(Show Context)
We propose formal means for synthesizing switching protocols that determine the sequence in which the modes of a switched system are activated to satisfy certain high-level specifications in linear temporal logic (LTL). The synthesized protocols are robust against exogenous disturbances on the continuous dynamics and can react to possibly adversarial events (both external and internal). Finite-state approximations that abstract the behavior of the underlying continuous dynamics are defined using finite transition systems. Such approximations allow us to transform the continuous switching synthesis problem into a discrete synthesis problem in the form of a two-player game between the system and the environment, where the winning conditions represent the high-level temporal logic specifications. Restricting to an expressive subclass of LTL formulas, these temporal logic games are amenable to solutions with polynomial-time complexity. By construction, existence of a discrete switching strategy for the discrete synthesis problem guarantees the existence of a switching protocol that can be implemented at the continuous level to ensure the correctness of the nonlinear switched system and to react to the environment at run time.

### DRAFT 1 Synthesis of Switching Protocols from Temporal Logic Specifications

"... We propose formal means for synthesizing switching protocols that determine the sequence in which the modes of a switched system are activated to satisfy certain high-level specifications in linear temporal logic. The synthesized protocols are robust against exogenous disturbances on the continuous ..."

Abstract
- Add to MetaCart

(Show Context)
We propose formal means for synthesizing switching protocols that determine the sequence in which the modes of a switched system are activated to satisfy certain high-level specifications in linear temporal logic. The synthesized protocols are robust against exogenous disturbances on the continuous dynamics. Two types of finite transition systems, namely under- and over-approximations, that abstract the behavior of the underlying continuous dynamics are defined. In particular, we show that the discrete synthesis problem for an under-approximation can be formulated as a model checking problem, whereas that for an over-approximation can be transformed into a two-player game. Both of these formulations are amenable to efficient, off-the-shelf software tools. By construction, existence of a discrete switching strategy for the discrete synthesis problem guarantees the existence of a continuous switching protocol for the continuous synthesis problem, which can be implemented at the continuous level to ensure the correctness of the nonlinear switched system. Moreover, the proposed framework can be straightforwardly extended to accommodate specifications that require reacting to possibly adversarial external events. Finally, these results are illustrated using three examples from different application domains. Index Terms Hybrid systems, switching protocols, formal synthesis, linear temporal logic, model check-ing, temporal logic games.