English
Related papers

Related papers: Expressiveness of Extended Bounded Response LTL

200 papers

Reactive synthesis is a key technique for the design of correct-by-construction systems and has been thoroughly investigated in the last decades. It consists in the synthesis of a controller that reacts to environment's inputs satisfying a…

Formal Languages and Automata Theory · Computer Science 2020-08-13 Alessandro Cimatti , Luca Geatti , Nicola Gigante , Angelo Montanari , Stefano Tonetta

While the complexity of translating future linear temporal logic (LTL) into automata on infinite words is well-understood, the size increase involved in turning automata back to LTL is not. In particular, there is no known elementary bound…

Formal Languages and Automata Theory · Computer Science 2022-05-10 Udi Boker , Karoliina Lehtinen , Salomon Sickert

Reinforcement Learning (RL) has emerged as an efficient method of choice for solving complex sequential decision making problems in automatic control, computer science, economics, and biology. In this paper we present a model-free RL…

Logic in Computer Science · Computer Science 2019-09-13 Mohammadhosein Hasanbeig , Yiannis Kantaros , Alessandro Abate , Daniel Kroening , George J. Pappas , Insup Lee

We introduce LTLf+ and PPLTL+, two logics to express properties of infinite traces, that are based on the linear-time temporal logics LTLf and PPLTL on finite traces. LTLf+/PPLTL+ use levels of Manna and Pnueli's LTL safety-progress…

Logic in Computer Science · Computer Science 2024-11-15 Benjamin Aminof , Giuseppe De Giacomo , Sasha Rubin , Moshe Y. Vardi

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

In this paper, we propose a novel one-pass and tree-shaped tableau method for Timed Propositional Temporal Logic and for a bounded variant of its extension with past operators. Timed Propositional Temporal Logic (TPTL) is a real-time…

Logic in Computer Science · Computer Science 2018-09-11 Luca Geatti , Nicola Gigante , Angelo Montanari , Mark Reynolds

Reinforcement learning (RL) is a promising approach. However, success is limited to real-world applications, because ensuring safe exploration and facilitating adequate exploitation is a challenge for controlling robotic systems with…

Robotics · Computer Science 2022-08-29 Mingyu Cai , Cristian-Ioan Vasile

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

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 2019-09-19 Daniel Neider , Alexander Weinert , Martin Zimmermann

Temporal synthesis is the automated design of a system that interacts with an environment, using the declarative specification of the system's behavior. A popular language for providing such a specification is Linear Temporal Logic, or LTL.…

Logic in Computer Science · Computer Science 2020-08-18 Shufang Zhu , Lucas M. Tabajara , Jianwen Li , Geguang Pu , Moshe Y. Vardi

We study the realizability problem for Safety LTL, the syntactic fragment of Linear Temporal Logic capturing safe formulas. We show that the problem is EXP-complete, disproving the existing conjecture of 2EXP-completeness. We achieve this…

Logic in Computer Science · Computer Science 2022-01-20 Noel Arteche , Montserrat Hermo

We present a novel asynchronous hyper linear time temporal logic named LPrL (Linear Time Predicate Logic) and establish its basic theory. LPrL is a natural first order extension of LTL (Linear time temporal logic), in which the predicates…

Logic in Computer Science · Computer Science 2026-01-22 Parasara Sridhar Duggirala , P. S. Thiagarajan

In this paper we give automata-based representation of LTL-FO$^+$ properties. LTL-FO$^+$ is an extension of LTL that includes first-order quantification over bounded variable, thus greatly increasing the expressivity of the language. An…

Formal Languages and Automata Theory · Computer Science 2016-10-25 Yannick Lebrun , Raphaël Khoury , Sylvain Hallé

This paper introduces time window temporal logic (TWTL), a rich expressivity language for describing various time bounded specifications. In particular, the syntax and semantics of TWTL enable the compact representation of serial tasks,…

Formal Languages and Automata Theory · Computer Science 2016-02-16 Cristian-Ioan Vasile , Derya Aksaray , Calin Belta

This paper presents a model-free reinforcement learning (RL) algorithm to synthesize a control policy that maximizes the satisfaction probability of linear temporal logic (LTL) specifications. Due to the consideration of environment and…

Formal Languages and Automata Theory · Computer Science 2022-01-04 Mingyu Cai , Shaoping Xiao , Baoluo Li , Zhiliang Li , Zhen Kan

Linear temporal logic (LTL) is a powerful language for task specification in reinforcement learning, as it allows describing objectives beyond the expressivity of conventional discounted return formulations. Nonetheless, recent works have…

Machine Learning · Computer Science 2025-06-11 Marco Bagatella , Andreas Krause , Georg Martius

Standpoint linear temporal logic SLTL is a recent formalism able to model possibly conflicting commitments made by distinct agents, taking into account aspects of temporal reasoning. In this paper, we analyse the computational properties of…

Logic in Computer Science · Computer Science 2024-08-19 Stéphane Demri , Przemysław Andrzej Wałęga

Ensuring that reinforcement learning (RL) controllers satisfy safety and reliability constraints in real-world settings remains challenging: state-avoidance and constrained Markov decision processes often fail to capture trajectory-level…

Machine Learning · Computer Science 2026-04-06 Alper Kamil Bozkurt , Calin Belta , Ming C. Lin

The paper is focused on temporal logics for the description of the behaviour of real-time pushdown reactive systems. The paper is motivated to bridge tractable logics specialized for expressing separately dense-time real-time properties and…

Logic in Computer Science · Computer Science 2019-11-20 Laura Bozzelli , Aniello Murano , Adriano Peron

Signal temporal logic (STL) is an expressive language to specify time-bound real-world robotic tasks and safety specifications. Recently, there has been an interest in learning optimal policies to satisfy STL specifications via…

Machine Learning · Computer Science 2020-02-19 Harish Venkataraman , Derya Aksaray , Peter Seiler
‹ Prev 1 2 3 10 Next ›