English
Related papers

Related papers: Bounded Synthesis of Synchronized Distributed Mode…

200 papers

Automatic synthesis of hardware components from declarative specifications is an ambitious endeavor in computer aided design. Existing synthesis algorithms are often implemented with Binary Decision Diagrams (BDDs), inheriting their…

Logic in Computer Science · Computer Science 2013-11-15 Roderick Bloem , Robert Koenighofer , Martina Seidl

A distributed protocol is typically modeled as a set of communicating processes, where each process is described as an extended state machine along with fairness assumptions, and its correctness is specified using safety and liveness…

Formal Languages and Automata Theory · Computer Science 2015-05-19 Rajeev Alur , Mukund Raghothaman , Christos Stergiou , Stavros Tripakis , Abhishek Udupa

Feature modeling is a widely used formalism to characterize a set of products (also called configurations). As a manual elaboration is a long and arduous task, numerous techniques have been proposed to reverse engineer feature models from…

Software Engineering · Computer Science 2015-02-17 Guillaume Bécan , Razieh Behjati , Arnaud Gotlieb , Mathieu Acher

We present a tractable method for synthesizing arbitrarily large concurrent programs, for a shared memory model with common hardware-available primitives such as atomic registers, compare-and-swap, load-linked/store conditional, etc. The…

Logic in Computer Science · Computer Science 2008-01-14 Paul C. Attie

We study automated test generation for verifying discrete decision-making modules in autonomous systems. We utilize linear temporal logic to encode the requirements on the system under test in the system specification and the behavior that…

Developing critical components, such as mission controllers or embedded systems, is a challenging task. Reactive synthesis is a technique to automatically produce correct controllers. Given a high-level specification written in LTL,…

Logic in Computer Science · Computer Science 2023-12-15 Matías Brizzio , César Sánchez

The unrealizability of a specification is often due to the assumption that the behavior of the environment is unrestricted. In this paper, we present algorithms for synthesis in bounded environments, where the environment can only generate…

Logic in Computer Science · Computer Science 2021-01-01 Rayna Dimitrova , Bernd Finkbeiner , Hazem Torfah

Timed regular expressions serve as a formalism for specifying real-time behaviors of Cyber-Physical Systems. In this paper, we consider the synthesis of timed regular expressions, focusing on generating a timed regular expression consistent…

Formal Languages and Automata Theory · Computer Science 2025-09-12 Ziran Wang , Jie An , Naijun Zhan , Miaomiao Zhang , Zhenya Zhang

Automatic synthesis from temporal logic specifications is an attractive alternative to manual system design, due to its ability to generate correct-by-construction implementations from high-level specifications. Due to the high complexity…

Logic in Computer Science · Computer Science 2023-01-25 Philippe Heim , Rayna Dimitrova

Reactive synthesis is the task of automatically deriving a correct implementation from a specification. It is a promising technique for the development of verified programs and hardware. Despite recent advances in terms of algorithms and…

Logic in Computer Science · Computer Science 2021-12-17 Bernd Finkbeiner , Gideon Geier , Noemi Passing

This paper presents an algorithmic framework for control synthesis of continuous dynamical systems subject to signal temporal logic (STL) specifications. We propose a novel algorithm to obtain a time-partitioned finite automaton from an STL…

Systems and Control · Electrical Eng. & Systems 2022-10-05 Qi Heng Ho , Roland B. Ilyes , Zachary N. Sunberg , Morteza Lahijanian

We present a framework that takes a concurrent program composed of unsynchronized processes, along with a temporal specification of their global concurrent behaviour, and automatically generates a concurrent program with synchronization…

Logic in Computer Science · Computer Science 2012-07-05 Roopsha Samanta

Most algorithms for the synthesis of reactive systems focus on the construction of finite-state machines rather than actual programs. This often leads to badly structured, unreadable code. In this paper, we present a bounded synthesis…

Formal Languages and Automata Theory · Computer Science 2018-07-25 Carsten Gerstacker , Felix Klein , Bernd Finkbeiner

This paper presents a fully automated procedure for controller synthesis for multi-agent systems under coupled constraints. Each agent has dynamics consisting of two terms: the first one models the coupled constraints and the other one is…

Systems and Control · Computer Science 2016-09-20 Alexandros Nikou , Dimitris Boskos , Jana Tumova , Dimos V. Dimarogonas

We propose an algorithmic approach for synthesizing linear hybrid automata from time-series data. Unlike existing approaches, our approach provides a whole family of models. Each model in the family is guaranteed to capture the input data…

Formal Languages and Automata Theory · Computer Science 2022-10-25 Miriam García Soto , Thomas A. Henzinger , Christian Schilling

We propose here a framework to model real-time components consisting of concurrent real-time tasks running on a single processor, using parametric timed automata. Our framework is generic and modular, so as to be easily adapted to different…

Operating Systems · Computer Science 2014-04-02 Youcheng Sun , Giuseppe Lipari , Étienne André , Laurent Fribourg

This paper introduces a general approach for synthesizing procedural models of the state-transitions of a given discrete system. The approach is general in that it accepts different target languages for modeling the state-transitions of a…

Formal Languages and Automata Theory · Computer Science 2023-07-28 Javier Segovia-Aguas , Jonathan Ferrer-Mestres , Sergio Jiménez

We introduce a technique for synthesis of control and communication strategies for a team of agents from a global task specification given as a Linear Temporal Logic (LTL) formula over a set of properties that can be satisfied by the…

Robotics · Computer Science 2011-11-10 Yushan Chen , Xu Chu Ding , Calin Belta

We consider the synthesis of distributed implementations for specifications in parameterized temporal logics such as PROMPT-LTL, which extends LTL by temporal operators equipped with parameters that bound their scope. For single process…

Logic in Computer Science · Computer Science 2018-02-28 Swen Jacobs , Leander Tentrup , Martin Zimmermann

This paper presents a method for synthesizing a reactive program which coordinates the actions of a group of other reactive programs, so that the combined system satisfies a temporal specification of its desired long-term behavior.…

Programming Languages · Computer Science 2019-11-12 Suguman Bansal , Kedar S. Namjoshi , Yaniv Sa'ar
‹ Prev 1 2 3 10 Next ›