English
Related papers

Related papers: Finite LTL Synthesis with Environment Assumptions …

200 papers

This paper describes a technique for inferring temporal-logic properties for sets of finite data streams. Such data streams arise in many domains, including server logs, program testing, and financial and marketing data; temporal-logic…

Logic in Computer Science · Computer Science 2020-06-09 Samuel Huang , Rance Cleaveland

We discuss the problem of experimentally evaluating linear-time temporal logic (LTL) synthesis tools for reactive systems. We first survey previous such work for the currently publicly available synthesis tools, and then draw conclusions by…

Logic in Computer Science · Computer Science 2011-02-22 Rüdiger Ehlers

There are spatio-temporal rules that dictate how robots should operate in complex environments, e.g., road rules govern how (self-driving) vehicles should behave on the road. However, seamlessly incorporating such rules into a robot control…

Robotics · Computer Science 2022-02-07 Karen Leung , Marco Pavone

This work studies the planning problem for robotic systems under both quantifiable and unquantifiable uncertainty. The objective is to enable the robotic systems to optimally fulfill high-level tasks specified by Linear Temporal Logic (LTL)…

Robotics · Computer Science 2025-02-28 Pian Yu , Yong Li , David Parker , Marta Kwiatkowska

In this paper, we study the composition of services so as to obtain runs satisfying a task specification in Linear Temporal Logic on finite traces (LTLf). We study the problem in the case services are nondeterministic and the LTLf…

Logic in Computer Science · Computer Science 2023-12-01 Giuseppe De Giacomo , Marco Favorito , Luciana Silo

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

This paper addresses the synthesis of reactive systems that enforce hard constraints while optimizing for quality-based soft constraints. We build on recent advancements in combining reactive synthesis with example-based guidance to handle…

Formal Languages and Automata Theory · Computer Science 2024-10-14 Jean-François Raskin , Yun Chen Tsai

Reactive synthesis builds a system from a specification given as a temporal logic formula. Traditionally, reactive synthesis is defined for systems with Boolean input and output variables. Recently, new theories and techniques have been…

Logic in Computer Science · Computer Science 2021-08-03 Benedikt Maderbacher , Roderick Bloem

Reactive synthesis addresses the problem of generating a controller for a temporal specification in an adversarial environment; it was typically studied for LTL. Driven by applications ranging from AI to business process management, LTL…

Logic in Computer Science · Computer Science 2025-08-26 Sarah Winkler

We design controllers from formal specifications for positive discrete-time monotone systems that are subject to bounded disturbances. Such systems are widely used to model the dynamics of transportation and biological networks. The…

Systems and Control · Computer Science 2018-03-20 Sadra Sadraddini , Calin Belta

Constructing good test cases is difficult and time-consuming, especially if the system under test is still under development and its exact behavior is not yet fixed. We propose a new approach to compute test strategies for reactive systems…

Software Engineering · Computer Science 2018-09-11 Roderick Bloem , Goerschwin Fey , Fabian Greif , Robert Koenighofer , Ingo Pill , Heinz Riener , Franz Roeck

In many real-world applications of control system and robotics, linear temporal logic (LTL) is a widely-used task specification language which has a compositional grammar that naturally induces temporally extended behaviours across tasks,…

Artificial Intelligence · Computer Science 2022-12-16 Duo Xu , Faramarz Fekri

Formalisms based on temporal logics interpreted over finite strict linear orders, known in the literature as finite traces, have been used for temporal specification in automated planning, process modelling, (runtime) verification and…

Logic in Computer Science · Computer Science 2022-02-02 Alessandro Artale , Andrea Mazzullo , Ana Ozaki

Autonomous agents often operate in uncertain environments where their decisions are made based on beliefs over states of targets. We are interested in controller synthesis for complex tasks defined over belief spaces. Designing such…

Systems and Control · Computer Science 2015-10-30 Chanyeol Yoo , Calin Belta

Finite turn-based safety games have been used for very different problems such as the synthesis of linear temporal logic (LTL), the synthesis of schedulers for computer systems running on multiprocessor platforms, and also for the…

Logic in Computer Science · Computer Science 2014-05-08 Gilles Geeraerts , Joël Goossens , Amélie Stainer

The temporal logics LTLf+ and PPLTL+ have recently been proposed to express objectives over infinite traces. These logics are appealing because they match the expressive power of LTL on infinite traces while enabling efficient DFA-based…

Formal Languages and Automata Theory · Computer Science 2025-05-26 Giuseppe De Giacomo , Yong Li , Sven Schewe , Christoph Weinhuber , Pian Yu

Correct-by-design synthesis provides a principled framework for establishing formal safety guarantees for stochastic multi-agent systems (MAS). However, conventional approaches based on finite abstractions often incur prohibitive…

Systems and Control · Electrical Eng. & Systems 2026-04-09 Xinyuan Qiu , Ruohan Wang , Siyuan Liu , Sofie Haesaert

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

We consider here Linear Temporal Logic (LTL) formulas interpreted over \emph{finite} traces. We denote this logic by LTLf. The existing approach for LTLf satisfiability checking is based on a reduction to standard LTL satisfiability…

Logic in Computer Science · Computer Science 2014-03-10 Jianwen Li , Lijun Zhang , Geguang Pu , Moshe Y. Vardi , Jifeng He

We propose LeanLTL, a unifying framework for linear temporal logics in Lean 4. LeanLTL supports reasoning about traces that represent either infinite or finite linear time. The library allows traditional LTL syntax to be combined with…

Logic in Computer Science · Computer Science 2025-07-03 Eric Vin , Kyle A. Miller , Daniel J. Fremont
‹ Prev 1 3 4 5 6 7 10 Next ›