English
Related papers

Related papers: On Expressive Powers of Timed Logics: Comparing Bo…

200 papers

In this paper, we construct and investigate a hierarchy of spatio-temporal formalisms that result from various combinations of propositional spatial and temporal logics such as the propositional temporal logic PTL, the spatial logics RCC-8,…

Artificial Intelligence · Computer Science 2011-10-13 D. Gabelaia , R. Kontchakov , A. Kurucz , F. Wolter , M. Zakharyaschev

Metric Temporal Logic (MTL) is a prominent specification formalism for real-time systems. In this paper, we show that the satisfiability problem for MTL over finite timed words is decidable, with non-primitive recursive complexity. We also…

Logic in Computer Science · Computer Science 2017-01-11 Joel Ouaknine , James Worrell

This paper establishes relative expressiveness results for several modal mu-calculi interpreted over timed automata. These mu-calculi combine modalities for expressing passage of (real) time with a general framework for defining formulas…

Logic in Computer Science · Computer Science 2025-08-08 Rance Cleaveland , Jeroen J. A. Keiren , Peter Fontana

We introduce a weighted linear dynamic logic (weighted LDL for short) and show the expressive equivalence of its formulas to weighted rational expressions. This adds a new characterization for recognizable series to the fundamental…

Logic in Computer Science · Computer Science 2016-09-15 Manfred Droste , George Rahonis

Model checking linear-time properties expressed in first-order logic has non-elementary complexity, and thus various restricted logical languages are employed. In this paper we consider two such restricted specification logics, linear…

Logic in Computer Science · Computer Science 2019-03-14 Michael Benedikt , Rastislav Lenhardt , James Worrell

The use of exponentials in linear logic greatly enhances its expressive power. In this paper we focus on nonassociative noncommutative multiplicative linear logic, and systematically explore modal axioms K, T, and 4 as well as the…

Logic in Computer Science · Computer Science 2023-06-23 Eben Blaisdell

Previous work has shown that reasoning with real-time temporal logics is often simpler when restricted to models with bounded variability---where no more than v events may occur every V time units, for given v, V. When reasoning about…

Logic in Computer Science · Computer Science 2015-02-24 Carlo A. Furia , Paola Spoletini

Various extensions of the temporal logic ATL have recently been introduced to express rich properties of multi-agent systems. Among these, ATLsc extends ATL with strategy contexts, while Strategy Logic has first-order quantification over…

Logic in Computer Science · Computer Science 2013-07-18 François Laroussinie , Nicolas Markey

We address the relative expressiveness of defeasible logics in the framework DL. Relative expressiveness is formulated as the ability to simulate the reasoning of one logic within another logic. We show that such simulations must be…

Artificial Intelligence · Computer Science 2021-02-16 Michael Maher

We investigate the decidability of the ${0,\infty}$ fragment of Timed Propositional Temporal Logic (TPTL). We show that the satisfiability checking of TPTL$^{0,\infty}$ is PSPACE-complete. Moreover, even its 1-variable fragment…

Logic in Computer Science · Computer Science 2023-09-04 Shankara Narayanan Krishna , Khushraj Nanik Madnani , Rupak Majumdar , Paritosh K. Pandya

We study positional properties in the context of game-based reactive synthesis. Our motivation stems from having a usable specification logic, for which tractable synthesis is guaranteed. We demonstrate that every $\omega$-regular…

Logic in Computer Science · Computer Science 2026-04-29 Jessica Newman , Benjamin Plummer

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

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

It is well known that MTL with integer endpoints is unable to express all of monadic first-order logic of order and metric (FO(<,+1)). Indeed, MTL is unable to express the counting modalities $C_n$ that assert a properties holds $n$ times…

Logic in Computer Science · Computer Science 2012-09-05 Paul Hunter

It is well known that (timed) $\omega$-regular properties such as `p holds at every even position' and `p occurs at least three times within the next 10 time units' cannot be expressed in Metric Interval Temporal Logic ($\mathsf{MITL}$) and…

Logic in Computer Science · Computer Science 2018-12-27 Hsi-Ming Ho

Constraint LTL, a generalisation of LTL over Presburger constraints, is often used as a formal language to specify the behavior of operational models with constraints. The freeze quantifier can be part of the language, as in some real-time…

Logic in Computer Science · Computer Science 2007-05-23 Stéphane Demri , Ranko Lazic , David Nowak

In this article we study linear temporal logics with team semantics (TeamLTL) that are novel logics for defining hyperproperties. We define Kamp-type translations of these logics into fragments of first-order team logic and second-order…

Logic in Computer Science · Computer Science 2021-10-22 Juha Kontinen , Max Sandström

We investigate the expressive power of state space models (SSM), which have recently emerged as a potential alternative to transformer architectures in large language models. Building on recent work, we analyse SSM expressiveness through…

Logic in Computer Science · Computer Science 2026-01-28 Eric Alsmann , Lowejatan Noori , Martin Lange

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

In the last years, model checking with interval temporal logics is emerging as a viable alternative to model checking with standard point-based temporal logics, such as LTL, CTL, CTL*, and the like. The behavior of the system is modeled by…

Logic in Computer Science · Computer Science 2019-02-07 Laura Bozzelli , Alberto Molinari , Angelo Montanari , Adriano Peron , Pietro Sala