1,588 research outputs found
The Complexity of Synthesizing Uniform Strategies
We investigate uniformity properties of strategies. These properties involve
sets of plays in order to express useful constraints on strategies that are not
\mu-calculus definable. Typically, we can state that a strategy is
observation-based. We propose a formal language to specify uniformity
properties, interpreted over two-player turn-based arenas equipped with a
binary relation between plays. This way, we capture e.g. games with winning
conditions expressible in epistemic temporal logic, whose underlying
equivalence relation between plays reflects the observational capabilities of
agents (for example, synchronous perfect recall). Our framework naturally
generalizes many other situations from the literature. We establish that the
problem of synthesizing strategies under uniformity constraints based on
regular binary relations between plays is non-elementary complete.Comment: In Proceedings SR 2013, arXiv:1303.007
Symbolic models for nonlinear control systems without stability assumptions
Finite-state models of control systems were proposed by several researchers
as a convenient mechanism to synthesize controllers enforcing complex
specifications. Most techniques for the construction of such symbolic models
have two main drawbacks: either they can only be applied to restrictive classes
of systems, or they require the exact computation of reachable sets. In this
paper, we propose a new abstraction technique that is applicable to any smooth
control system as long as we are only interested in its behavior in a compact
set. Moreover, the exact computation of reachable sets is not required. The
effectiveness of the proposed results is illustrated by synthesizing a
controller to steer a vehicle.Comment: 11 pages, 2 figures, journa
Robust Model Predictive Control for Signal Temporal Logic Synthesis
Most automated systems operate in uncertain or adversarial conditions, and have to be capable of reliably reacting to changes in the environment. The focus of this paper is on automatically synthesizing reactive controllers for cyber-physical systems subject to signal temporal logic (STL) specifications. We build on recent work that encodes STL specifications as mixed integer linear constraints on the variables of a discrete-time model of the system and environment dynamics. To obtain a reactive controller, we present solutions to the worst-case model predictive control (MPC) problem using a suite of mixed integer linear programming techniques. We demonstrate the comparative effectiveness of several existing worst-case MPC techniques, when applied to the problem of control subject to temporal logic specifications; our empirical results emphasize the need to develop specialized solutions for this domain
Automated Synthesis of Enforcing Mechanisms for Security Properties in a Timed Setting
AbstractIn [Martinelli, F. and I. Matteucci, Modeling security automata with process algebras and related results (2006), presented at the 6th International Workshop on Issues in the Theory of Security (WITS '06) - Informal proceedings; Martinelli, F. and I. Matteucci, Through modeling to synthesis of security automata (2006), accepted to STM06. To appeare in ENTCS] we have presented an approach for enforcing security properties. It is based on the automatic synthesis of controller programs that are able to detect and eventually prevent possible wrong action performed by an external agent. Here, we extend this approach also to a timed setting. Under certain assumptions, we are also able to enforce several information flow properties. We show how to deal with parameterized systems
Towards Scalable Synthesis of Stochastic Control Systems
Formal control synthesis approaches over stochastic systems have received
significant attention in the past few years, in view of their ability to
provide provably correct controllers for complex logical specifications in an
automated fashion. Examples of complex specifications of interest include
properties expressed as formulae in linear temporal logic (LTL) or as automata
on infinite strings. A general methodology to synthesize controllers for such
properties resorts to symbolic abstractions of the given stochastic systems.
Symbolic models are discrete abstractions of the given concrete systems with
the property that a controller designed on the abstraction can be refined (or
implemented) into a controller on the original system. Although the recent
development of techniques for the construction of symbolic models has been
quite encouraging, the general goal of formal synthesis over stochastic control
systems is by no means solved. A fundamental issue with the existing techniques
is the known "curse of dimensionality," which is due to the need to discretize
state and input sets and that results in an exponential complexity over the
number of state and input variables in the concrete system. In this work we
propose a novel abstraction technique for incrementally stable stochastic
control systems, which does not require state-space discretization but only
input set discretization, and that can be potentially more efficient (and thus
scalable) than existing approaches. We elucidate the effectiveness of the
proposed approach by synthesizing a schedule for the coordination of two
traffic lights under some safety and fairness requirements for a road traffic
model. Further we argue that this 5-dimensional linear stochastic control
system cannot be studied with existing approaches based on state-space
discretization due to the very large number of generated discrete states.Comment: 22 pages, 3 figures. arXiv admin note: text overlap with
arXiv:1407.273
- …