English
Related papers

Related papers: Research Challenges in Orchestration Synthesis

200 papers

Service composition has become commonplace nowadays, in large part due to the increased complexity of software and supporting networks. Composition can be of many types, for instance sequential, prioritising, non-deterministic. However, a…

Logic in Computer Science · Computer Science 2016-06-08 Mats Neovius , Luigia Petre , Kaisa Sere

A key property for systems subject to uncertainty in their operating environment is robustness, ensuring that unmodelled, but bounded, disturbances have only a proportionally bounded effect upon the behaviours of the system. Inspired by…

Systems and Control · Computer Science 2011-08-24 Rupak Majumdar , Elaine Render , Paulo Tabuada

Hybrid automata are a natural framework for modeling and analyzing systems which exhibit a mixed discrete continuous behaviour. However, the standard operational semantics defined over such models implicitly assume perfect knowledge of the…

Systems and Control · Computer Science 2013-08-27 Alberto Casagrande , Tommaso Dreossi , Carla Piazza

As robots gain capabilities to enter our human-centric world, they require formalism and algorithms that enable smart and efficient interactions. This is challenging, especially for robotic manipulators with complex tasks that may require…

Robotics · Computer Science 2022-03-15 Karan Muvvala , Peter Amorese , Morteza Lahijanian

A modern approach to engineering correct-by-construction systems is to synthesize them automatically from formal specifications. Oftentimes, a system can only satisfy its guarantees if certain environment assumptions hold, which motivates…

Logic in Computer Science · Computer Science 2015-07-10 Roderick Bloem , Ruediger Ehlers , Robert Koenighofer

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

Program synthesis is the task of automatically generating a program consistent with a given specification. A natural way to specify programs is to provide examples of desired input-output behavior, and many current program synthesis…

Machine Learning · Computer Science 2020-07-28 Alexander Suh , Yuval Timen

In Reasoning about Action and Planning, one synthesizes the agent plan by taking advantage of the assumption on how the environment works (that is, one exploits the environment's effects, its fairness, its trajectory constraints). In this…

Logic in Computer Science · Computer Science 2019-05-23 Benjamin Aminof , Giuseppe De Giacomo , Aniello Murano , Sasha Rubin

Modern control is implemented with digital microcontrollers, embedded within a dynamical plant that represents physical components. We present a new algorithm based on counter-example guided inductive synthesis that automates the design of…

Systems and Control · Computer Science 2017-02-17 Alessandro Abate , Iury Bessa , Dario Cattaruzza , Lucas Cordeiro , Cristina David , Pascal Kesseli , Daniel Kroening

Reactive synthesis transforms a specification of a reactive system, given in a temporal logic, into an implementation. The main advantage of synthesis is that it is automatic. The main disadvantage is that the implementation is usually very…

Logic in Computer Science · Computer Science 2021-01-01 Tom Baumeister , Bernd Finkbeiner , Hazem Torfah

We study the problem of plan synthesis for multi-agent systems, to achieve complex, high-level, long-term goals that are assigned to each agent individually. As the agents might not be capable of satisfying their respective goals by…

Systems and Control · Computer Science 2016-10-27 Jana Tumova , Dimos V. Dimarogonas

Partial observability and controllability are two well-known issues in test-case synthesis for interactive systems. We address the problem of partial control in the synthesis of test cases from timed-automata specifications. Building on the…

Formal Languages and Automata Theory · Computer Science 2018-05-04 Léo Henry , Thierry Jéron , Nicolas Markey

We present for the first time a complete solution to the problem of proving the correctness of a concurrency control algorithm for collaborative text editors against the standard consistency model. The success of our approach stems from the…

Data Structures and Algorithms · Computer Science 2023-06-12 James Smith

Algorithmic contract design studies scenarios where a principal incentivizes an agent to exert effort on her behalf. In this work, we focus on settings where the agent's type is drawn from an unknown distribution, and formalize an offline…

Computer Science and Game Theory · Computer Science 2025-01-27 Paul Duetting , Michal Feldman , Tomasz Ponitka , Ermis Soumalias

We explore and formalize the task of synthesizing programs over noisy data, i.e., data that may contain corrupted input-output examples. By formalizing the concept of a Noise Source, an Input Source, and a prior distribution over programs,…

Programming Languages · Computer Science 2021-04-29 Shivam Handa , Martin Rinard

This paper presents a compositional approach to specification-guided abstraction refinement for control synthesis of a nonlinear system associated with a method to over-approximate its reachable sets. Given an initial coarse partition of…

Systems and Control · Computer Science 2017-12-19 Pierre-Jean Meyer , Dimos V. Dimarogonas

Pattern discovery algorithms in the music domain aim to find meaningful components in musical compositions. Over the years, although many algorithms have been developed for pattern discovery in music data, it remains a challenging task. To…

Sound · Computer Science 2020-10-26 Iris Ren , Anja Volk , Wouter Swierstra , Remco C. Veltkamp

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

Contract automata have been introduced for specifying applications through behavioural contracts and for synthesising their orchestrations as finite state automata. This paper addresses the realisation of applications from contract automata…

Software Engineering · Computer Science 2023-03-16 Davide Basile , Maurice H. ter Beek

We study the problem of synthesizing a controller for a robot with a surveillance objective, that is, the robot is required to maintain knowledge of the location of a moving, possibly adversarial target. We formulate this problem as a…

Robotics · Computer Science 2018-03-21 Suda Bharadwaj , Rayna Dimitrova , Ufuk Topcu