Pthread-style multithreaded programs feature rich thread communication mechanisms, such
as shared variables, signals, and broadcasts. In this article, we consider the automated …

This paper introduces the notion of well-structured language. A well-structured language
can be defined by a labelled well-structured transition system, equipped with an upward …

We study foundational problems regarding the expressive power of parameterised systems.
These (infinite-state) systems are composed of arbitrarily many finite-state processes that …

We compare the expressive power of a class of well-structured transition systems that
includes relational automata (extensions of), Petri nets, lossy channel systems, constrained …

Vector addition systems are an important model in theoretical computer science and have
been used in a variety of areas. In this paper, we consider vector addition systems with …

We use language theory to study the relative expressiveness of infinite-state models laying
in between finite automata and Turing machines. We focus here our attention on well …

We compare the expressive power of a class of well-structured transition systems that
includes relational automata, Petri nets, lossy channel systems, and constrained multiset …

We give a unified view of different parameterized models of concurrent and distributed
systems with broadcast communication based on transition systems. Based on the resulting …

One-Counter Nets (OCNs) are finite-state automata equipped with a counter that is not
allowed to become negative, but does not have zero tests. Their simplicity and close …

During the last fifty years, computers have been increasingly present in our daily life. They
can be found in many applications, as embedded systems. These applications are …