English
Related papers

Related papers: Synthesizing Reactive Systems from Hyperproperties

200 papers

Hyperproperties, as introduced by Clarkson and Schneider, characterize the correctness of a computer program as a condition on its set of computation paths. Standard temporal logics can only refer to a single path at a time, and therefore…

Logic in Computer Science · Computer Science 2013-07-01 Bernd Finkbeiner , Markus N. Rabe , César Sánchez

An enforcement mechanism monitors a reactive system for undesired behavior at runtime and corrects the system's output in case it violates the given specification. In this paper, we study the enforcement problem for hyperproperties, i.e.,…

Logic in Computer Science · Computer Science 2022-03-09 Norine Coenen , Bernd Finkbeiner , Christopher Hahn , Jana Hofmann , Yannick Schillo

This paper deals with the control synthesis problem for a continuous nonlinear dynamical system under a Linear Temporal Logic (LTL) formula. The proposed solution is a top-down hierarchical decomposition of the control problem involving…

Systems and Control · Computer Science 2021-04-09 Pierre-Jean Meyer , Dimos V. Dimarogonas

Quantitative extensions of temporal logics have recently attracted significant attention. In this work, we study frequency LTL (fLTL), an extension of LTL which allows to speak about frequencies of events along an execution. Such an…

Logic in Computer Science · Computer Science 2015-09-15 Vojtěch Forejt , Jan Krčál , Jan Křetínský

Linear temporal logic (LTL) is a specification language for finite sequences (called traces) widely used in program verification, motion planning in robotics, process mining, and many other areas. We consider the problem of learning LTL…

Artificial Intelligence · Computer Science 2026-01-22 Ritam Raha , Rajarshi Roy , Nathanaël Fijalkow , Daniel Neider

We present an analysis technique for temporal specifications of reactive systems that identifies, on the level of individual system outputs over time, which parts of the implementation are determined by the specification, and which parts…

Formal Languages and Automata Theory · Computer Science 2018-03-28 Bernd Finkbeiner , Hazem Torfah

System requirements related to concepts like information flow, knowledge, and robustness cannot be judged in terms of individual system executions, but rather require an analysis of the relationship between multiple executions. Such…

Logic in Computer Science · Computer Science 2025-01-15 Bernd Finkbeiner

The classical LTL synthesis problem is purely qualitative: the given LTL specification is realized or not by a reactive system. LTL is not expressive enough to formalize the correctness of reactive systems with respect to some quantitative…

Logic in Computer Science · Computer Science 2013-01-10 Aaron Bohy , Véronique Bruyère , Emmanuel Filiot , Jean-François Raskin

Synthesizing a reactive system from specifications given in linear temporal logic (LTL) is a classical problem, finding its applications in safety-critical systems design. These systems are typically represented using either Mealy machines…

Artificial Intelligence · Computer Science 2026-04-28 Jan Křetínský , Tobias Meggendorfer , Maximilian Prokop

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

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

Linear Temporal Logic (LTL) is the standard specification language for reactive systems and is successfully applied in industrial settings. However, many shortcomings of LTL have been identified in the literature, among them the limited…

Logic in Computer Science · Computer Science 2021-04-30 Daniel Neider , Alexander Weinert , Martin Zimmermann

LTL synthesis -- the construction of a function to satisfy a logical specification formulated in Linear Temporal Logic -- is a 2EXPTIME-complete problem with relevant applications in controller synthesis and a myriad of artificial…

Logic in Computer Science · Computer Science 2016-11-18 Jorge A. Baier , Alberto Camacho , Christian Muise , Sheila A. McIlraith

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

Formal control of cyber-physical systems allows for synthesis of control strategies from rich specifications such as temporal logics. However, the classes of systems that the formal approaches can be applied to is limited due to the…

Logic in Computer Science · Computer Science 2019-09-04 Irmak Saglam , Ebru Aydin Gol

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

This paper proposes a language for describing reactive synthesis problems that integrates imperative and declarative elements. The semantics is defined in terms of two-player turn-based infinite games with full information. Currently,…

Logic in Computer Science · Computer Science 2016-02-04 Ioannis Filippidis , Richard M. Murray , Gerard J. Holzmann

We consider the synthesis of distributed implementations for specifications in Prompt Linear Temporal Logic (PROMPT-LTL), which extends LTL by temporal operators equipped with parameters that bound their scope. For single process synthesis…

Logic in Computer Science · Computer Science 2016-09-15 Swen Jacobs , Leander Tentrup , Martin Zimmermann

We introduce a novel logic for the specification of context-free hyperproperties, which capture, e.g., the flow of information in security-critical recursive systems. Intuitively, the logic extends visibly pushdown automata by…

Logic in Computer Science · Computer Science 2026-05-07 Sarah Winter , Martin Zimmermann

We reduce synthesis for CTL* properties to synthesis for LTL. In the context of model checking this is impossible - CTL* is more expressive than LTL. Yet, in synthesis we have knowledge of the system structure and we can add new outputs.…

Formal Languages and Automata Theory · Computer Science 2017-11-30 Roderick Bloem , Sven Schewe , Ayrat Khalimov
‹ Prev 1 3 4 5 6 7 10 Next ›