English
Related papers

Related papers: Parametric Linear Dynamic Logic (full version)

200 papers

The idea of automatic synthesis of reactive programs starting from temporal logic (LTL) specifications is quite old, but was commonly thought to be infeasible due to the known double exponential complexity of the problem. However, new ideas…

Logic in Computer Science · Computer Science 2011-02-22 Andreas Morgenstern , Klaus Schneider

Linear Temporal Logic (LTL) is a widely used specification framework for linear time properties of systems. The standard approach for verifying such properties is by transforming LTL formulae to suitable $\omega$-automata and then applying…

Formal Languages and Automata Theory · Computer Science 2017-10-19 Martin Sulzmann , Peter Thiemann

One of the advantages of adopting a Model Based Development (MBD) process is that it enables testing and verification at early stages of development. However, it is often desirable to not only verify/falsify certain formal system…

Logic in Computer Science · Computer Science 2017-02-07 Bardh Hoxha , Adel Dokhanchi , Georgios Fainekos

This paper presents an incremental replanning algorithm, dubbed LTL-D*, for temporal-logic-based task planning in a dynamically changing environment. Unexpected changes in the environment may lead to failures in satisfying a task…

Robotics · Computer Science 2024-04-02 Jiming Ren , Haris Miller , Karen M. Feigh , Samuel Coogan , Ye Zhao

The parameter synthesis problem for parametric timed automata is undecidable in general even for very simple reachability properties. In this paper we introduce restrictions on parameter valuations under which the parameter synthesis…

Formal Languages and Automata Theory · Computer Science 2016-03-07 Peter Bezděk , Nikola Beneš , Jiří Barnat , Ivana Černá

We develop a timeout based extension of propositional linear temporal logic (which we call TLTL) to specify timing properties of timeout based models of real time systems. TLTL formulas explicitly refer to a running global clock together…

Logic in Computer Science · Computer Science 2010-12-20 Janardan Misra , Suman Roy

We consider the optimization variant of the realizability problem for Prompt Linear Temporal Logic, an extension of Linear Temporal Logic (LTL) by the prompt eventually operator whose scope is bounded by some parameter. In the realizability…

Logic in Computer Science · Computer Science 2016-09-15 Leander Tentrup , Alexander Weinert , Martin Zimmermann

A challenging problem for autonomous systems is to synthesize a reactive controller that conforms to a set of given correctness properties. Linear temporal logic (LTL) provides a formal language to specify the desired behavioral properties…

Formal Languages and Automata Theory · Computer Science 2019-10-08 Rayna Dimitrova , Mahsa Ghasemi , Ufuk Topcu

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

Automatic synthesis from linear temporal logic (LTL) specifications is widely used in robotic motion planning, control of autonomous systems, and load distribution in power networks. A common specification pattern in such applications…

Logic in Computer Science · Computer Science 2018-04-03 Rayna Dimitrova , Mahsa Ghasemi , Ufuk Topcu

Hyperproperties enable simultaneous reasoning about multiple execution traces of a system and are useful to reason about non-interference, opacity, robustness, fairness, observational determinism, etc. We introduce hyper parametric timed…

Formal Languages and Automata Theory · Computer Science 2024-08-01 Masaki Waga , Étienne André

We present CLTLB(D), an extension of PLTLB (PLTL with both past and future operators) augmented with atomic formulae built over a constraint system D. Even for decidable constraint systems, satisfiability and Model Checking problem of such…

Logic in Computer Science · Computer Science 2010-04-21 Marcello M. Bersani , Achille Frigeri , Angelo Morzenti , Matteo Pradella , Matteo Rossi , Pierluigi San Pietro

Following the idea of Subexponential Linear Logic and Stratified Bounded Linear Logic, we propose a new parameterized version of Linear Logic which subsumes other systems like ELL, LLL or SLL, by including variants of the exponential rules.…

Logic in Computer Science · Computer Science 2022-01-03 Esaïe Bauer , Olivier Laurent

Motion planning of autonomous agents in partially known environments with incomplete information is a challenging problem, particularly for complex tasks. This paper proposes a model-free reinforcement learning approach to address this…

Artificial Intelligence · Computer Science 2023-05-02 Junchao Li , Mingyu Cai , Zhen Kan , Shaoping Xiao

We develop team semantics for Linear Temporal Logic (LTL) to express hyperproperties, which have recently been identified as a key concept in the verification of information flow properties. Conceptually, we consider an asynchronous and a…

Logic in Computer Science · Computer Science 2018-06-26 Andreas Krebs , Arne Meier , Jonni Virtema , Martin Zimmermann

This paper investigates whether recent advances in Large Language Models (LLMs) can assist in translating human explanations into a format that can robustly support learning Linear Temporal Logic (LTL) from demonstrations. Both LLMs and…

Artificial Intelligence · Computer Science 2024-04-04 Ashutosh Gupta , John Komp , Abhay Singh Rajput , Krishna Shankaranarayanan , Ashutosh Trivedi , Namrita Varshney

Runtime monitoring is one of the central tasks to provide operational decision support to running business processes, and check on-the-fly whether they comply with constraints and rules. We study runtime monitoring of properties expressed…

Artificial Intelligence · Computer Science 2014-05-02 Giuseppe De Giacomo , Riccardo De Masellis , Marco Grasso , Fabrizio Maggi , Marco Montali

We study the problem of policy optimization (PO) with linear temporal logic (LTL) constraints. The language of LTL allows flexible description of tasks that may be unnatural to encode as a scalar cost function. We consider LTL-constrained…

Machine Learning · Computer Science 2022-10-21 Cameron Voloshin , Hoang M. Le , Swarat Chaudhuri , Yisong Yue

There has been substantial progress in the inference of formal behavioural specifications from sample trajectories, for example, using Linear Temporal Logic (LTL). However, these techniques cannot handle specifications that correctly…

Logic in Computer Science · Computer Science 2025-05-20 Rajarshi Roy , Yash Pote , David Parker , Marta Kwiatkowska

We present team semantics for two of the most important linear and branching time specification languages, Linear Temporal Logic (LTL) and Computation Tree Logic (CTL). With team semantics, LTL is able to express hyperproperties, which have…

Logic in Computer Science · Computer Science 2025-10-14 Andreas Krebs , Arne Meier , Jonni Virtema , Martin Zimmermann