Journal ArticleDOI
Temporal Logic Control of Discrete-Time Piecewise Affine Systems
Boyan Yordanov,Jana Tumova,Ivana Černá,Jiří Barnat,Calin Belta +4 more
- Vol. 57, Iss: 6, pp 1491-1504
Reads0
Chats0
TLDR
A computational framework for automatic synthesis of a feedback control strategy for a discrete-time piecewise affine (PWA) system from a specification given as a linear temporal logic formula over an arbitrary set of linear predicates in the system's state variables is presented.Abstract:
We present a computational framework for automatic synthesis of a feedback control strategy for a discrete-time piecewise affine (PWA) system from a specification given as a linear temporal logic (LTL) formula over an arbitrary set of linear predicates in the system's state variables. Our approach consists of two main steps. First, by defining appropriate partitions for its state and input spaces, we construct a finite abstraction of the PWA system in the form of a control transition system. Second, by leveraging ideas and techniques from LTL model checking and Rabin games, we develop an algorithm to generate a control strategy for the finite abstraction. While provably correct and robust to state measurements and small perturbations in the applied inputs, the overall procedure is conservative and expensive. The proposed algorithms have been implemented as a software package and made available for download. Illustrative examples are included.read more
Citations
More filters
Journal ArticleDOI
Feedback Refinement Relations for the Synthesis of Symbolic Controllers
TL;DR: This work builds on a general notion of system with set-valued dynamics and possibly non-deterministic quantizers to permit the synthesis of controllers that robustly, and provably, enforce the specification in the presence of various types of uncertainties and disturbances.
Proceedings ArticleDOI
SCOTS: A Tool for the Synthesis of Symbolic Controllers
Matthias Rungger,Majid Zamani +1 more
TL;DR: SCOTS a software tool for the automatic controller synthesis for nonlinear control systems based on symbolic models, also known as discrete abstractions, which natively provides algorithms to synthesize controllers with respect to invariance and reachability specifications.
Journal ArticleDOI
Optimality and Robustness in Multi-Robot Path Planning with Temporal Logic Constraints
TL;DR: A method for automatic planning of optimal paths for a group of robots that satisfy a common high-level mission specification and leverages the communication capabilities of the robots to guarantee correctness during deployment and provide bounds on the deviation from the optimal values.
Journal ArticleDOI
Optimal Control of Markov Decision Processes With Linear Temporal Logic Constraints
TL;DR: A sufficient condition for a policy to be optimal is proposed, and a dynamic programming algorithm is developed that synthesizes a policy that is optimal for a set of LTL specifications.
Proceedings ArticleDOI
Efficient finite abstraction of mixed monotone systems
Samuel Coogan,Murat Arcak +1 more
TL;DR: An efficient computational procedure for finite abstraction of discrete-time mixed monotone systems is presented by considering a rectangular partition of the state space and tightly overapproximate the one-step reachable set from a box of initial conditions.
References
More filters
Book
Principles of Model Checking
TL;DR: Principles of Model Checking offers a comprehensive introduction to model checking that is not only a text suitable for classroom use but also a valuable reference for researchers and practitioners in the field.
Journal ArticleDOI
Construction of a genetic toggle switch in Escherichia coli
TL;DR: The construction of a genetic toggle switch is presented—a synthetic, bistable gene-regulatory network—in Escherichia coli and a simple theory is provided that predicts the conditions necessary for bistability.
Proceedings ArticleDOI
On the synthesis of a reactive module
Amir Pnueli,Roni Rosner +1 more
TL;DR: An algorithm is presented based on a new procedure for checking the emptiness of Rabin automata on infinite trees in time exponential in the number of pairs, but only polynomial in theNumber of states, which leads to a synthesis algorithm whose complexity is doubleonential in the length of the given specification.