… languages as the subclass of regular MSC languages … a regular MSC language is finitely
generated. Following this, we establish our characterization result for regular MSC languages …

… Following this, we establish that the class of finitely generated regular MSC languages … ⊆M
is a regular MSC language if the corresponding string MSC language is a regular subset of Σ …

… of [10]) MSC-graph can be represented as a string language … linear extensions form a
regular string language. I will call … and finitely generated regular MSC languages. In ICALP’00, …

… We now extend our theory of regular MSC word languages to collections of MSCs.
Regularity of such a collection is reduced to regularity of the set of corresponding linearisations. …

… of regular MSC word languages. But as MSC words are dened over the innite alphabet …
In [10], a denition of regular word languages over innite alphabets is proposed by providing an …

… We characterize here the class of regular MSC languages that are MSG-definable in terms
of a notion called finitely generated MSC languages. We show that a regular MSC language …

… Another interesting characterization of regular MSC languages was es… of regular languages
are regular, we consider here the following problem for MSCs: given a regular language of …

… MSC language L as a word language L over Σ consisting of all linearizations of the MSCs in
L. For an MSC language … observed when characterizing regular MSC languages in terms of …

… languages such as HMSCs or compositional MSCs. In a second step, we propose dynamic
MSC grammars (DMG for short) as a specification language. … A nice theory of regular sets of …

… of an MSC-graph G, due to the gap between an MSCgraph and its … MSC associated
with the node consists of a single message edge. The language of this MSC graph is non-regular…