Linear-time temporal logics with Presburger constraints: an overview ★
type: Item
instance of: scholarly article
title: Linear-time temporal logics with Presburger constraints: an overview ★
zbMATH Open document ID: 1186.03036
author: Stéphane Demri
published in: Journal of Applied Non-Classical Logics
publication date: 2009-11-30T00:00:00Z
Mathematics Subject Classification ID: 03B44
Mathematics Subject Classification ID: 03D05
Mathematics Subject Classification ID: 68Q25
Mathematics Subject Classification ID: 68Q60
zbMATH DE Number: 5640524
zbMATH Keywords: temporal logic
zbMATH Keywords: Presburger arithmetic
zbMATH Keywords: Büchi automaton
zbMATH Keywords: computational complexity
MaRDI profile type: Publication
full work available at URL: jancl.16.311-347
OpenAlex ID: W2019346963
cites work: The power of temporal proofs
cites work: A theory of timed automata
cites work: A really temporal logic
cites work: The benefits of relaxing punctuality
cites work: Graded modalities. I
cites work: Guest editorial: Temporal representation and reasoning
cites work: About the decision of reachability for register machines
cites work: Flat fragments of CTL and CTL: separating the expressive and distinguishing powers
cites work: Presburger liveness verification of discrete timed automata.
cites work: From local to global consistency
cites work: Equality and monodic first-order temporal logic
cites work: Q4415249
cites work: LTL over integer periodicity constraints
cites work: In so many possible worlds
cites work: Modal Logics Between Propositional and First-order
cites work: Semigroups, Presburger formulas, and languages
cites work: Future temporal logic needs infinitely many modalities
cites work: Counting Objects
cites work: Reversal-Bounded Multicounter Machines and Their Decision Problems
cites work: On the interpretability of arithmetic in temporal logic
cites work: Propositional temporal logics: decidability and completeness
cites work: NEXP TIME-complete description logics with concrete domains
cites work: Q5590814
cites work: Automata for branching and layered temporal structures. An investigation into regularities of infinite transition systems
cites work: Introduction to constraint databases
cites work: The complexity of the temporal logic with ``until'' over general linear time
cites work: Verifying lossy channel systems has nonprimitive recursive complexity.
cites work: The complexity of propositional linear temporal logics
cites work: Datalog with integer periodicity constraints
cites work: Reasoning about infinite computations
cites work: Pushdown processes: Games and model-checking
DOI: 10.3166/JANCL.16.311-347
description: scientific article