We describe a uniform and efficient framework for checking the satisfiability of a large class
of string constraints. The framework is based on the observation that both satisfiability and …

We consider a general class of decision problems concerning formal languages, called
“(one-dimensional) unboundedness predicates”, for automata that feature reversal-bounded …

Several notions of synchronizability of a message-passing system have been introduced in
the literature. Roughly, a system is called synchronizable if every execution can be …

The undecidability of basic decision problems for general FIFO machines such as
reachability and unboundedness is well-known. In this paper, we provide an …

The decidability and complexity of reachability problems and model-checking for flat counter
machines have been explored in detail. However, only few results are known for flat (lossy) …

A vector addition system (VAS) with an initial and a final marking and transition labels
induces a language. In part because the reachability problem in VAS remains far from being …

We give a general approach to show the closure under complement and decide the
emptiness for many classes of multistack visibly pushdown automata (Mvpa). A central …

We show that reachability, repeated reachability, nontermination and unboundedness are
NP-complete for Lossy Channel Machines that are flat, ie, with no nested cycles in the …

We study valence systems, finite-control programs over infinite-state memories modeled in
terms of graph monoids. Our contribution is a notion of bounded context switching (BCS) …

This paper introduces the concept of shape signals, ie, series of shapes which have a
natural temporal or spatial ordering, as well as a variational formulation for the regularization …