22 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…
Christoph Czepa, Amirali Amiri, Evangelos Ntentos, Uwe Zdun
Mature verification and monitoring approaches, such as complex event processing and model checking, can be applied for checking compliance specifications at design time and runtime. Little is known about the understandability of the different formal and technical languages associated with these approaches. This…
Gerald Heddy, Umer Huzaifa, Peter Beling, Yacov Haimes + 3 more
'Jeremy Marvel' 'Brian Weiss' 'Amy LaViers'] The vision of Smart Manufacturing Systems (SMS) includes collaborative robots that can adapt to a range of scenarios. This vision requires a classification of multiple system behaviors, or sequences of movement, that can achieve the same high-level tasks. Likewise, this…
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…
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…
Arne Meier, Sebastian Ordyniak, M. S. Ramanujan, Irena Schindler
In the present paper, we introduce the backdoor set approach into the field of temporal logic for the global fragment of linear temporal logic. We study the parameterized complexity of the satisfiability problem parameterized by the size of the backdoor. We distinguish between backdoor detection and evaluation of…
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…
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…
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…
Thomas Reinbacher, Matthias Függer, Jörg Brauer
We present a runtime verification framework that allows on-line monitoring of past-time Metric Temporal Logic (ptMTL) specifications in a discrete time setting. We design observer algorithms for the time-bounded modalities of ptMTL, which take advantage of the highly parallel nature of hardware designs. The algorithms…
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…
Pedro Cabalar, Roland Kaminski, Torsten Schaub, Anna Schuhmann
In this paper, we introduce an alternative approach to Temporal Answer Set Programming that relies on a variation of Temporal Equilibrium Logic (TEL) for finite traces. This approach allows us to even out the expressiveness of TEL over infinite traces with the computational capacity of (incremental) Answer Set…
Mariam Bonyadi Camacho, Warut D. Vijitbenjaronk, Thomas J Anastasio
The clinical practice of selective serotonin reuptake inhibitor (SSRI) augmentation relies heavily on clinical judgment and trial-and-error. Unfortunately, the drug combinations prescribed today fail to provide relief for all treatment-resistant depressed patients. In order to identify potentially more effective…
Felicidad Aguado, Pedro Cabalar, Martín Diéguez, Gilberto Perez + 3 more
'Torsten Schaub' 'Anna Schuhmann' 'Concepción Vidal'] In this survey, we present an overview on (Modal) Temporal Logic Programming in view of its application to Knowledge Representation and Declarative Problem Solving. The syntax of this extension of logic programs is the result of combining usual rules with temporal…
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…
Ovidiu Pârvu, David Gilbert, Attila Csikász-Nagy
Insights gained from multilevel computational models of biological systems can be translated into real-life applications only if the model correctness has been verified first. One of the most frequently employed in silico techniques for computational model verification is model checking. Traditional model checking…
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…
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…
Maribel Fernández, Jack Hughes, Dominic Orchard
Linear types provide a way to constrain programs by specifying that some values must be used exactly once. Recent work on graded modal types augments and refines this notion, enabling fine-grained, quantitative specification of data use in programs. The information provided by graded modal types appears to be useful…
Victoria Hsiao, Yutaka Hori, Paul W.K. Rothemund, Richard M. Murray
Single-cell bacterial sensors have numerous applications in human health monitoring, environmental chemical detection, and materials biosynthesis. Such bacterial devices need not only the capability to differentiate between combinations of inputs, but also the ability to process signal timing and duration. In this…
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…
Authors not listed
While virtual libraries of synthetically accessible compounds have exploded in size to many billions, our capacity to extract valuable drug leads from these vast databases remains limited by computational resources. To overcome this, we developed SLICE SMARTS and Logic In ChEmistry), a powerful new tool designed for…