19 papers · ranked by Valyu relevance
Bernd Finkbeiner, Felix Klein, Niklas Metzger
Synthesis automatically constructs an implementation that satisfies a given logical specification. In this paper, we study the live synthesis problem, where the synthesized implementation replaces an already running system. In addition to satisfying its own specification, the synthesized implementation must guarantee a…
Manuel Toscano-Moreno, Anthony Mandow, María Alcázar Martínez, Alfonso José García-Cerezo + 4 more
'Alfonso José García-Cerezo' 'Yingbai Hu' 'Chao Zeng' 'Alois Christian Knoll' 'Shu Li'] Linear temporal logic (LTL) formalism can ensure the correctness of mobile robot planning through concise, readable, and verifiable mission specifications. For uneven terrain, planning must consider motion constraints related to…
Mingyu Cai, Shaoping Xiao, Junchao Li, Zhen Kan
This paper proposes an advanced Reinforcement Learning (RL) method, incorporating reward-shaping, safety value functions, and a quantum action selection algorithm. The method is model-free and can synthesize a finite policy that maximizes the probability of satisfying a complex task. Although RL is a promising…
Eric Vin, Kyle A. Miller, Daniel J. Fremont
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 arbitrary Lean expressions, making it straightforward to define properties involving…
Rayhana Amjad, Rob van Glabbeek, Liam O’Connor
LTL3 is a multi-valued variant of Linear-time Temporal Logic for runtime verification applications. The semantic descriptions of LTL3 in previous work are given only in terms of the relationship to conventional LTL. Our approach, by contrast, gives a full model-based inductive accounting of the semantics of LTL3, in…
Luca Geatti, Marco Montali, Andrey Rivkin
Given a specification of linear-time temporal logic interpreted over finite traces (LTLf), the reactive synthesis problem asks to find a finitely-representable, terminating controller that reacts to the uncontrollable actions of an environment in order to enforce a desired system specification. In this paper we study…
Parastou Fahim, Constantino Lagoa, Rômulo Meira-G'oes
Learning temporal logic specifications from system demonstrations is essential for tasks such as formal verification and controller synthesis, especially in safety-critical domains. Existing approaches typically assume demonstrations are correct or only affected by misclassification errors. In practice, however, system…
Wesley R. Bezerra, Jean E. Martina, Carlos B. Westphall, Alessandra Rizzardi
'Alessandra Rizzardi'] There are many security challenges in IoT, especially related to the authentication of restricted devices in long-distance and low-throughput networks. Problems such as impersonation, privacy issues, and excessive battery usage are some of the existing problems evaluated through the threat…
Alessandro Artale, Andrea Mazzullo, Ana Ozaki
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 synthesis of programs, as well as in knowledge representation and reasoning. In this…
Difei Tang, Natasa Miskov-Zivanov
In computational modeling, Bounded Linear Temporal Logic (BLTL) is a valuable formalism for describing and verifying the temporal behavior of biological systems. However, translating natural language (NL) descriptions of system behaviors into accurate BLTL properties remains a labor-intensive task, requiring deep…
Difei Tang, Natasa Miskov-Zivanov
Translating natural language biological discoveries into formal temporal logic specifications for model verification demands expertise most experimentalists lack. Bounded Linear Temporal Logic (BLTL), which attaches explicit time bounds to temporal operators, is well suited for capturing biological dynamics. However…
Luca Boscarato, Ivan Donadello, Alessandro Artale, Marco Montali + 1 more
Most of the existing neuro-symbolic AI methods focus on the scenario of static knowledge where objects do not change according to a temporal dimension. Temporal neuro-symbolic works are still under explored and are mainly developed for time-interval logic or propositional linear temporal logic. There is a lack of…
Colin Thomas, Maximilien Cosme, Cédric Gaucherel, Franck Pommereau
Model-checking is a methodology developed in computer science to automatically assess the dynamics of discrete systems, by checking if a system modelled as a state-transition graph satisfies a dynamical property written as a temporal logic formula. The dynamics of ecosystems have been drawn as state-transition graphs…
Susana Hahn
In our daily lives, we commonly encounter problems that require reasoning with time. For instance, planning our day, determining our route to work, or scheduling our tasks. We refer to these problems as 'dynamic' because they involve movement and change over time, which sometimes includes metric information to express…
Agnieszka M. Zbrzezny, Andrzej Zbrzezny, Christian Haubelt
Metric temporal logic (MTL) is a popular real-time extension of linear temporal logic (LTL). This paper presents a new simple SAT-based bounded model-checking (SAT-BMC) method for MTL interpreted over discrete infinite timed models generated by discrete timed automata with digital clocks. We show a new translation of…
Arturo Tozzi
The origin of life is a complex scientific problem demanding interdisciplinary approaches. We propose a Linear Logic (LL)-based computational framework to formally evaluate the feasibility of early biochemical pathways across competing abiogenesis scenarios. Unlike classical logic, LL explicitly tracks resource…
Wei Zhao, Zhiming Liu, Qichun Zhang
The traditional synthesis problem is usually solved by constructing a system that fulfills given specifications. The system is constantly interacting with the environment and is opposed to the environment. The problem can be further regarded as solving a two-player game (the system and its environment). Meanwhile…
Pedro Cabalar, Martín Diéguez, François Laferrière, Torsten Schaub
Extensions of Answer Set Programming with language constructs from temporal logics, such as temporal equilibrium logic over finite traces (TELf ), provide an expressive computational framework for modeling dynamic applications. In this paper, we study the so-called past-present syntactic subclass, which consists of a…
Tomoya Maruyama, Jing Gong, Masahiro Takinoue
Bio-soft matter droplets formed via liquid-liquid phase separation (LLPS) of biopolymers have been found in living cells. Synthetic LLPS droplets have recently been employed in nanobiotechnology for artificial cell construction, molecular robotics, molecular computing, diagnosis, and therapeutics. Controlling the…