Parikh's Theorem states that semilinear sets are effectively equivalent with the Parikh
images of regular languages and those of context-free languages. In this paper, we study …

We introduce parametric semilinear data logic (pSDL) for reasoning about data words with
numeric data. The logic allows parameters, and Presburger guards on the data and on the …

Model checking is a fully-automatic formal verification method that has been extremely
successful in validating and verifying safety-critical systems in the past three decades. In the …

We prove that language equivalence of deterministic one-counter automata is NL-complete.
This improves the superpolynomial time complexity upper bound shown by Valiant and …

Parametric timed automata (PTA) have been introduced by Alur, Henzinger, and Vardi as an
extension of timed automata in which clocks can be compared against parameters. The …

A one-counter automaton is a pushdown automaton with a singleton stack alphabet, where
stack emptiness can be tested; it is a real-time automaton if it contains no ε-transitions. We …

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 …

Energy games are a well-studied class of 2-player turn-based games on a finite graph
where transitions are labeled with integer vectors which represent changes in a …

In computer graphics, object are often represented by triangle meshes. Iterative collapse of
geometric elements is an important way to simplify the meshes. This paper presents a …

In a Church synthesis game, two players, Adam and Eve, alternately pick some element in a
finite alphabet, for an infinite number of rounds. The game is won by Eve if the ω-word …