English
Related papers

Related papers: Bounded Variability of Metric Temporal Logic

200 papers

This paper studies Linear Temporal Logic over Finite Traces (LTLf) where proposition letters are replaced with first-order formulas interpreted over arbitrary theories, in the spirit of Satisfiability Modulo Theories. The resulting logic,…

Logic in Computer Science · Computer Science 2022-05-25 Luca Geatti , Alessandro Gianola , Nicola Gigante

We present a hierarchical framework for analysing propositional linear-time temporal logic (PTL) to obtain standard results such as a small model property, decision procedures and axiomatic completeness. Both finite time and infinite time…

Logic in Computer Science · Computer Science 2007-05-23 Ben Moszkowski

Higher-Order Fixpoint Logic (HFL) is a hybrid of the simply typed \lambda-calculus and the modal \lambda-calculus. This makes it a highly expressive temporal logic that is capable of expressing various interesting correctness properties of…

Logic in Computer Science · Computer Science 2015-07-01 Roland Axelsson , Martin Lange , Rafal Somla

Temporal logics (TLs) have been widely used to formalize interpretable tasks for cyber-physical systems. Time Window Temporal Logic (TWTL) has been recently proposed as a specification language for dynamical systems. In particular, it can…

Formal Languages and Automata Theory · Computer Science 2023-04-14 Ahmad Ahmad , Cristian-Ioan Vasile , Roberto Tron , Calin Belta

Temporal Reasoning (TR) is a critical ability for LLMs to understand and reason over temporal information and relationships between events. To study the TR ability in LLMs, prior works provide different ways for evaluating various aspects…

Computation and Language · Computer Science 2026-01-06 Weizhi Tang , Kwabena Nuamah , Vaishak Belle

First-order temporal logics are notorious for their bad computational behaviour. It is known that even the two-variable monadic fragment is highly undecidable over various linear timelines, and over branching time even one-variable…

Logic in Computer Science · Computer Science 2015-08-17 Christopher Hampson , Agi Kurucz

This paper considers the challenges Large Language Models (LLMs) face when reasoning over text that includes information involving uncertainty explicitly quantified via probability values. This type of reasoning is relevant to a variety of…

Computation and Language · Computer Science 2024-12-30 Aliakbar Nafar , Kristen Brent Venable , Parisa Kordjamshidi

Large Language Models (LLMs) have demonstrated impressive capabilities in reasoning and prediction across different domains. Yet, their ability to infer temporal regularities from structured behavioral data remains underexplored. This paper…

It is well known that the verification of resource-constrained multiagent systems is undecidable in general. In many such settings, resources are private to agents. In this paper, we investigate the model checking problem for a resource…

Logic in Computer Science · Computer Science 2015-08-17 Nils Bulling , Hoang Nga Nguyen

In this paper, we consider the problem of controlling a dynamical system such that its trajectories satisfy a temporal logic property in a given amount of time. We focus on multi-affine systems and specifications given as syntactically…

Systems and Control · Computer Science 2012-03-27 Ebru Aydin Gol , Calin Belta

We introduce and investigate a number of fragments of propo- sitional temporal logic LTL over the flow of time (Z, <). The fragments are defined in terms of the available temporal operators and the structure of the clausal normal form of…

Logic in Computer Science · Computer Science 2013-10-11 A. Artale , R. Kontchakov , V. Ryzhikov , M. Zakharyaschev

There are many types of automata and grammar models that have been studied in the literature, and for these models, it is common to determine whether certain problems are decidable. One problem that has been difficult to answer throughout…

Formal Languages and Automata Theory · Computer Science 2024-05-20 Oscar H. Ibarra , Ian McQuillan

We present Stratified Metric Temporal Logic (SMTL), a novel formalism for specifying and verifying properties of complex cyber-physical systems that exhibit behaviors across multiple temporal and abstraction scales. SMTL extends existing…

Systems and Control · Electrical Eng. & Systems 2025-01-13 Ali Baheri , Peng Wei

We address the problem of learning temporal properties from the branching-time behavior of systems. Existing research in this field has mostly focused on learning linear temporal properties specified using popular logics, such as Linear…

Logic in Computer Science · Computer Science 2024-07-01 Benjamin Bordais , Daniel Neider , Rajarshi Roy

Temporal Logic (TL) guided control problems have gained interests in recent years. By using the TL, one can specify a wide range of temporal constraints on the system and is widely used in cyber-physical systems. On the other hand, Control…

Systems and Control · Computer Science 2019-03-12 Guang Yang , Roberto Tron , Calin Belta

We introduce the logic $\sf ITL^e$, an intuitionistic temporal logic based on structures $(W,\preccurlyeq,S)$, where $\preccurlyeq$ is used to interpret intuitionistic implication and $S$ is a $\preccurlyeq$-monotone function used to…

Logic · Mathematics 2017-04-11 Joseph Boudou , Martín Diéguez , David Fernández-Duque

The paper proposes and studies temporal logics for attributed words, that is, data words with a (finite) set of (attribute,value)-pairs at each position. It considers a basic logic which is a semantical fragment of the logic…

Logic in Computer Science · Computer Science 2015-03-17 Ahmet Kara , Thomas Schwentick , Thomas Zeume

Many modern autonomous systems, particularly multi-agent systems, are time-critical and need to be robust against timing uncertainties. Previous works have studied left and right time robustness of signal temporal logic specifications by…

Systems and Control · Electrical Eng. & Systems 2023-06-09 Alëna Rodionova , Lars Lindemann , Manfred Morari , George J. Pappas

Interval temporal logics provide a natural framework for qualitative and quantitative temporal reason- ing over interval structures, where the truth of formulae is defined over intervals rather than points. In this paper, we study the…

Logic in Computer Science · Computer Science 2011-06-08 Davide Bresolin , Angelo Montanari , Pietro Sala , Guido Sciavicco

Modal logics are widely used in computer science. The complexity of their satisfiability problems has been an active field of research since the 1970s. We prove that even very "simple" modal logics can be undecidable: We show that there is…

Logic in Computer Science · Computer Science 2011-05-05 Edith Hemaspaandra , Henning Schnoor