Parallelism and concurrency are fundamental concepts in computer science. Specification
and verification of concurrent programs are of first importance. It concerns our daily life …

Abstract Hierarchical Message Sequence Charts are a well-established formalism to specify
telecommunication protocols. In this model, numerous undecidability results were obtained …

Mazurkiewicz defined traces as an algebraic model of finite concurrent processes. In order
to model non-terminating processes a good notion of infinite traces was needed, which …

We prove that if it is decidable whether X* is recognizable for a recognizable subset X of a
free partially commutative monoid, then it is decidable whether a recognizable subset of a …

We prove that if it is decidable whether X* is recognizable for a recognizable subset X of a
free partially commutative monoid, then it is decidable whether a recognizable subset of a …

We consider here the decidability of the Star Problem in trace monoids (“assuming X is a
recognizable set of traces, is X* recognizable”) and the decidability of the Finite Power …

Trace theory was introduced to capture the behavior of 1-safe Petri nets, it is based on
partial commutation relations where two adjacent letters are allowed to permute. More …

This paper deals with a connection between the star problem and the finite power problem
in trace monoids. Both problems are decidable in trace monoids without C4 submonoid [21] …

This paper deals with decision problems related to the star problem in trace monoids which
means to determine whether the iteration of a recognizable trace language is recognizable …

The aim of this paper is the study of a procedure S given in [11, 13]. We prove that this
procedure can compute the closure of the star of a closed recognizable set of words if and …