A temporal graph is a dynamic graph where every edge is assigned a set of integer time
labels that indicate at which discrete time step the edge is available. In this paper, we study …

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 …

This paper studies model-checking of fragments and extensions of CTL* on infinitestate
counter systems, where the states are vectors of integers and the transitions are determined …

In this paper we consider several reachability problems such as vector reachability,
membership in matrix semigroups and reachability problems in piecewise linear maps …

In this paper we study decidability and complexity of decision problems on matrices from the
special linear group SL (2, Z). In particular, we study the freeness problem: given a finite set …

In this paper we provide several new results concerning word and matrix semigroup
problems using counter automaton models. As a main result, we prove a new version of …

The paper is devoted to several infinite-state Attacker–Defender games with reachability
objectives. We prove the undecidability of checking for the existence of a winning strategy in …

We introduce two generalizations of synchronizability to automata with transitions weighted
in an arbitrary semiring K=(K,+,*, 0, 1).(or equivalently, to finite sets of matrices in K^ nxn.) …

This paper studies the linear recurrence automata model in which multiple linear
recurrences can be used to generate sequences of numbers. We parameterised the model …

In the case of finite words, a Schützenberger theorem proves that the star-free sets are
exactly the languages recognized by finite aperiodic semigroups. This gives an algebraic …