English
Related papers

Related papers: Automated synthesis of reliable and efficient syst…

200 papers

Temporal synthesis attempts to construct reactive programs that satisfy a given declarative (LTL) formula. Practitioners have found it challenging to work exclusively with declarative specifications, and have found languages that combine…

Logic in Computer Science · Computer Science 2021-07-05 Shaun Azzopardi , Nir Piterman , Gerardo Schneider

Shield synthesis is an approach to enforce a set of safety-critical properties of a reactive system at runtime. A shield monitors the system and corrects any erroneous output values instantaneously. The shield deviates from the given…

Logic in Computer Science · Computer Science 2019-04-16 Laura Humphrey , Bettina Könighofer , Robert Könighofer , Ufuk Topcu

In the synthesis problem, we are given a specification, and we automatically generate a system that satisfies the specification in all environments. We introduce and study {\em synthesis with guided environments} (SGE, for short), where the…

Logic in Computer Science · Computer Science 2025-07-29 Orna Kupferman , Ofer Leshkowitz

Existing approaches to the synthesis of reactive systems typically involve the construction of transition systems such as Mealy automata. However, in order to obtain a succinct representation of the desired system, structured programs can…

Logic in Computer Science · Computer Science 2013-03-05 Benedikt Brütsch

Given a Linear Temporal Logic (LTL) formula over input and output variables, reactive synthesis requires us to design a deterministic Mealy machine that gives the values of outputs at every time step for every sequence of inputs, such that…

Logic in Computer Science · Computer Science 2024-01-23 S. Akshay , Eliyahu Basa , Supratik Chakraborty , Dror Fried

Smart contracts are small but highly error-prone programs that implement agreements between multiple parties. We present a reactive synthesis approach for the automatic construction of smart contract state machines. Towards this end, we…

Logic in Computer Science · Computer Science 2023-07-28 Bernd Finkbeiner , Jana Hofmann , Florian Kohn , Noemi Passing

We propose a new method for controlled system synthesis on non-deterministic automata, which includes the synthesis for deadlock-freeness, as well as invariant and reachability expressions. Our technique restricts the behavior of a…

Formal Languages and Automata Theory · Computer Science 2014-08-15 Allan van Hulst , Michel Reniers , Wan Fokkink

We present an automata-based algorithm to synthesize omega-regular causes for omega-regular effects on executions of a reactive system, such as counterexamples uncovered by a model checker. Our theory is a generalization of temporal…

Logic in Computer Science · Computer Science 2025-06-18 Bernd Finkbeiner , Hadar Frenkel , Niklas Metzger , Julian Siber

Functional verification constitutes one of the most challenging tasks in the development of modern hardware systems, and simulation-based verification techniques dominate the functional verification landscape. A dominant paradigm in…

Logic in Computer Science · Computer Science 2013-04-08 Supratik Chakraborty , Kuldeep S. Meel , Moshe Y. Vardi

We consider a problem on the synthesis of reactive controllers that optimize some a priori unknown performance criterion while interacting with an uncontrolled environment such that the system satisfies a given temporal logic specification.…

Logic in Computer Science · Computer Science 2015-03-09 Min Wen , Ruediger Ehlers , Ufuk Topcu

Autonomous systems are often deployed in complex sociotechnical environments, such as public roads, where they must behave safely and securely. Unlike many traditionally engineered systems, autonomous systems are expected to behave…

Robotics · Computer Science 2023-04-27 Georgios Bakirtzis , Steven Carr , David Danks , Ufuk Topcu

We have witnessed the emergence of several controller parameterizations and the corresponding synthesis methods, including Youla, system level, input-output, and many other new proposals. Meanwhile, under the same synthesis method, there…

Optimization and Control · Mathematics 2022-02-11 Shih-Hao Tseng

We consider the synthesis problem on timed automata with B\"uchi objectives, where delay choices made by a controller are subjected to small perturbations. Usually, the controller needs to avoid punctual guards, such as testing the equality…

Computer Science and Game Theory · Computer Science 2024-04-30 Benoît Barbot , Damien Busatto-Gaston , Catalin Dima , Youssouf Oualhadj

Software implementations of controllers for physical systems are at the core of many embedded systems. The design of controllers uses the theory of dynamical systems to construct a mathematical control law that ensures that the controlled…

Systems and Control · Computer Science 2012-04-16 Rupak Majumdar , Indranil Saha , Majid Zamani

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

Game theory is used by all behavioral sciences, but its development has long centered around tools for relatively simple games and toy systems, such as the economic interpretation of equilibrium outcomes. Our contribution, compositional…

Computer Science and Game Theory · Computer Science 2023-03-13 Seth Frey , Jules Hedges , Joshua Tan , Philipp Zahn

In this article, the problem of synthesizing switching controllers is considered through the synthesis of a "control certificate". Control certificates include control barrier and Lyapunov functions, which represent control strategies, and…

Systems and Control · Computer Science 2016-02-11 Hadi Ravanbakhsh , Sriram Sankaranarayanan

We investigate the problem of controller synthesis for hyperproperties specified in the temporal logic HyperLTL. Hyperproperties are system properties that relate multiple execution traces. Hyperproperties can elegantly express…

Logic in Computer Science · Computer Science 2021-01-25 Borzoo Bonakdarpour , Bernd Finkbeiner

Stochastic games are a convenient formalism for modelling systems that comprise rational agents competing or collaborating within uncertain environments. Probabilistic model checking techniques for this class of models allow us to formally…

Logic in Computer Science · Computer Science 2022-11-14 Marta Kwiatkowska , Gethin Norman , David Parker , Gabriel Santos

Given a relational specification between Boolean inputs and outputs, the goal of Boolean functional synthesis is to synthesize each output as a function of the inputs such that the specification is met. In this paper, we first show that…

Logic in Computer Science · Computer Science 2018-05-21 S. Akshay , Supratik Chakraborty , Shubham Goel , Sumith Kulal , Shetal Shah