Towards Efficient Exact Synthesis for Linear Hybrid Systems

We study the problem of automatically computing the controllable region of a Linear Hybrid Automaton, with respect to a safety objective. We describe the techniques that are needed to effectively and efficiently implement a recently-proposed solution procedure, based on polyhedral abstractions of the state space. Supporting experimental results are presented, based on an implementation of the proposed techniques on top of the tool PHAVer.Comment: In Proceedings GandALF 2011, arXiv:1106.081

As Soon as Possible: Time Optimal Control for Timed Automata

. In this work we tackle the following problem: given a timed automaton, and a target set F of configurations, restrict its transition relation in a systematic way so that from every state, the remaining behaviors reach F as soon as possible. This consists in extending the controller synthesis problem for timed automata, solved in [MPS95,AMPS98], to deal with quantitative properties of behaviors. The problem is formulated using the notion of a timed game automaton, and an optimal strategy is constructed as a fixed-point of an operator on the space of value functions defined on state-clock configurations. 1 Introduction Most of the research on verification and synthesis of discrete systems is based on the following approach: the set L of all possible behaviors of the system is partitioned into L' and L:' , the former consisting of behaviors satisfying a certain property '. Verification is the task of checking whether L:' is empty while synthesis is the restriction of the transition rel..