Zobrazeno 1 - 10
of 117 285
pro vyhledávání: '"Than LTL"'
Linear temporal logic (LTL) and, more generally, $\omega$-regular objectives are alternatives to the traditional discount sum and average reward objectives in reinforcement learning (RL), offering the advantage of greater comprehensibility and hence
Externí odkaz:
http://arxiv.org/abs/2410.12175
Linear temporal logic (LTL) has recently been adopted as a powerful formalism for specifying complex, temporally extended tasks in reinforcement learning (RL). However, learning policies that efficiently satisfy arbitrary specifications not observed
Externí odkaz:
http://arxiv.org/abs/2410.04631
Autor:
Ehlers, Rüdiger, Khalimov, Ayrat
Chains of co-B\"uchi automata (COCOA) have recently been introduced as a new canonical representation of omega-regular languages. The co-B\"uchi automata in a chain assign to each omega-word its natural color, which depends only on the language itsel
Externí odkaz:
http://arxiv.org/abs/2410.01021
Autor:
Raskin, Jean-François, Tsai, Yun Chen
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 both types
Externí odkaz:
http://arxiv.org/abs/2410.08599
Autor:
Cassidy, William B. bill.cassidy@spglobal.com
Publikováno v:
Journal of Commerce (1530-7557). 4/22/2024, Vol. 25 Issue 9, p32-35. 4p.
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 SLTL. Fir
Externí odkaz:
http://arxiv.org/abs/2408.08557
Autor:
Xuan, Zetong, Wang, Yu
Linear Temporal Logic (LTL) is a formal way of specifying complex objectives for planning problems modeled as Markov Decision Processes (MDPs). The planning problem aims to find the optimal policy that maximizes the satisfaction probability of the LT
Externí odkaz:
http://arxiv.org/abs/2408.05438
In recent years, Machine Learning (ML) models have achieved remarkable success in various domains. However, these models also tend to demonstrate unsafe behaviors, precluding their deployment in safety-critical systems. To cope with this issue, ample
Externí odkaz:
http://arxiv.org/abs/2406.04184
Autor:
Maxim V. Neyzov, Egor V. Kuzmin
Publikováno v:
Моделирование и анализ информационных систем, Vol 31, Iss 3, Pp 240-279 (2024)
The article continues the series of publications on the development and verification of control programs based on LTL-specifications of a special type. Earlier, a declarative LTL-specification was proposed to describe the strictly deterministic behav
Externí odkaz:
https://doaj.org/article/7b8c9ffc0b3c480a8bd054fe01cca27a
Autor:
Xiao, Shengping, Li, Yongkang, Zhu, Shufang, Sun, Jun, Li, Jianwen, Pu, Geguang, Vardi, Moshe Y.
We present an on-the-fly synthesis framework for Linear Temporal Logic over finite traces (LTLf) based on top-down deterministic automata construction. Existing approaches rely on constructing a complete Deterministic Finite Automaton (DFA) correspon
Externí odkaz:
http://arxiv.org/abs/2408.07324