English
Related papers

Related papers: Efficient Reactive Synthesis

200 papers

We define the GXW fragment of linear temporal logic (LTL) as the basis for synthesizing embedded control software for safety-critical applications. Since GXW includes the use of a weak-until operator we are able to specify a number of…

Logic in Computer Science · Computer Science 2016-07-07 Chih-Hong Cheng , Yassine Hamza , Harald Ruess

The reactive synthesis problem is to find a finite-state controller that satisfies a given temporal-logic specification regardless of how its environment behaves. Developing a formal specification is a challenging and tedious task and…

Logic in Computer Science · Computer Science 2013-08-20 Rajeev Alur , Salar Moarref , Ufuk Topcu

Reactive synthesis is concerned with finding a correct-by-construction controller from formal specifications, typically expressed in Linear Temporal Logic (LTL). The specifications describe assumptions about an environment and guarantees to…

Logic in Computer Science · Computer Science 2019-10-15 Davide G. Cavezza , Dalal Alrajeh , Andras Gyorgy

We introduce a tableau decision method for deciding realizability of specifications expressed in a safety fragment of LTL that includes bounded future temporal operators. Tableau decision procedures for temporal and modal logics have been…

Logic in Computer Science · Computer Science 2022-06-06 Montserrat Hermo , Paqui Lucio , César Sánchez

A challenging problem for autonomous systems is to synthesize a reactive controller that conforms to a set of given correctness properties. Linear temporal logic (LTL) provides a formal language to specify the desired behavioral properties…

Formal Languages and Automata Theory · Computer Science 2019-10-08 Rayna Dimitrova , Mahsa Ghasemi , Ufuk Topcu

The idea of automatic synthesis of reactive programs starting from temporal logic (LTL) specifications is quite old, but was commonly thought to be infeasible due to the known double exponential complexity of the problem. However, new ideas…

Logic in Computer Science · Computer Science 2011-02-22 Andreas Morgenstern , Klaus Schneider

Rational verification refers to the problem of checking which temporal logic properties hold of a concurrent multiagent system, under the assumption that agents in the system choose strategies that form a game-theoretic equilibrium.…

Logic in Computer Science · Computer Science 2022-07-19 Julian Gutierrez , Muhammad Najib , Giuseppe Perelli , Michael Wooldridge

Reactive synthesis is a key technique for the design of correct-by-construction systems and has been thoroughly investigated in the last decades. It consists in the synthesis of a controller that reacts to environment's inputs satisfying a…

Formal Languages and Automata Theory · Computer Science 2020-08-13 Alessandro Cimatti , Luca Geatti , Nicola Gigante , Angelo Montanari , Stefano Tonetta

Many problems in reactive synthesis are stated using two formulas ---an environment assumption and a system guarantee--- and ask for an implementation that satisfies the guarantee in environments that satisfy their assumption. Reactive…

Logic in Computer Science · Computer Science 2019-02-18 Rupak Majumdar , Nir Piterman , Anne-Kathrin Schmuck

Reactive synthesis is an automated procedure to obtain a correct-by-construction reactive system from a given specification. GR(1) is a well-known fragment of linear temporal logic (LTL) where synthesis is possible using a polynomial…

Software Engineering · Computer Science 2016-02-04 Shahar Maoz , Jan Oliver Ringert

Temporal logic based synthesis approaches are often used to find trajectories that are correct-by-construction for tasks in systems with complex behavior. Some examples of such tasks include synchronization for multi-agent hybrid systems,…

Logic in Computer Science · Computer Science 2017-09-22 Sumanth Dathathri , Richard M. Murray

Reactive synthesis is a technology for the automatic construction of reactive systems from logical specifications. In these lecture notes, we study different algorithms for the reactive synthesis problem of linear-time temporal logic (LTL).…

Logic in Computer Science · Computer Science 2018-03-28 Bernd Finkbeiner , Felix Klein

We present realizability and realization logic, two program logics that jointly address the problem of finding solutions in semantics-guided synthesis. What is new is that we proceed eagerly and not only analyze a single candidate program…

Logic in Computer Science · Computer Science 2024-03-12 Roland Meyer , Jakob Tepe , Sebastian Wolff

Designing tests to evaluate if a given autonomous system satisfies complex specifications is challenging due to the complexity of these systems. This work proposes a flow-based approach for reactive test synthesis from temporal logic…

Formal Languages and Automata Theory · Computer Science 2024-04-16 Josefine B. Graebener , Apurva S. Badithela , Denizalp Goktas , Wyatt Ubellacker , Eric V. Mazumdar , Aaron D. Ames , Richard M. Murray

One of the main challenges of reactive synthesis, an automated procedure to obtain a correct-by-construction reactive system, is to deal with unrealizable specifications. One means to deal with unrealizability, in the context of GR(1), an…

Software Engineering · Computer Science 2021-03-02 Shahar Maoz , Rafi Shalom

G4LTL-ST automatically synthesizes control code for industrial Programmable Logic Controls (PLC) from timed behavioral specifications of input-output signals. These specifications are expressed in a linear temporal logic (LTL) extended with…

Logic in Computer Science · Computer Science 2014-05-16 Chih-Hong Cheng , Chung-Hao Huang , Harald Ruess , Stefan Stattelmann

Reactive synthesis aims at automatic construction of systems from their behavioural specifications. The research mostly focuses on synthesis of systems dealing with Boolean signals. But real-life systems are often described using…

Formal Languages and Automata Theory · Computer Science 2018-09-14 Ayrat Khalimov , Benedikt Maderbacher , Roderick Bloem

Generalized Reactivity(1) (GR(1)) synthesis is a reactive synthesis approach in which the specification is split into two parts: a symbolic game graph, describing the safe transitions of a system, a liveness specification in a subset of…

Formal Languages and Automata Theory · Computer Science 2024-02-06 Rüdiger Ehlers , Ayrat Khalimov

This paper investigates the problem of designing control policies that satisfy high-level specifications described by signal temporal logic (STL) in unknown, stochastic environments. While many existing works concentrate on optimizing the…

Systems and Control · Electrical Eng. & Systems 2024-12-16 Siqi Wang , Shaoyuan Li , Li Yin , Xiang Yin

Writing formal specifications for distributed systems is difficult. Even simple consistency requirements often turn out to be unrealizable because of the complicated information flow in the distributed system: not all information is…

Logic in Computer Science · Computer Science 2017-01-11 Bernd Finkbeiner , Leander Tentrup
‹ Prev 1 2 3 10 Next ›