We consider an extension of linear-time temporal logic (LTL) with constraints interpreted
over a concrete domain. We use a new automata-theoretic technique to show PSPACE …

One-counter automata are a fundamental and widely-studied class of infinite-state systems.
In this paper we consider one-counter automata with counter updates encoded in binary …

We present an overview of linear-time temporal logics with Presburger constraints whose
models are sequences of tuples of integers. Such formal specification languages are well …

The program of the 30th Symposium on Logic in Computer Science held in 2015 in Kyoto
included two contributions on the computational complexity of the reachability problem for …

We study recursive timed automata that extend timed automata with recursion. Timed
automata, as introduced by Alur and Dill, are finite automata accompanied by a finite set of …

We investigate the decidability and complexity of various model checking problems over one-
counter automata. More specifically, we consider succinct one-counter automata, in which …

In this paper we work over linearly ordered data domains equipped with finitely many unary
predicates and constants. We consider nondeterministic automata processing words and …

We consider two-player games with reachability objectives played on transition systems of
succinct one-counter machines, that is, machines where the counter is incremented or …

This paper defines CLTLB (D), an extension of PLTLB (PLTL with both past and future
operators) augmented with atomic formulae built over a constraint system D. The paper …

We study the decidability status of model-checking freeze LTL over various subclasses of
counter machines for which the reachability problem is known to be decidable (reversal …