3 search results - page 1 / 1 » On Regular Message Sequence Chart Languages and Relationship... |
FOSSACS
2001
Springer
13 years 9 months ago
2001
Springer
Hierarchical Message Sequence Charts are a well-established formalism to specify telecommunication protocols. In this model, numerous undecidability results were obtained recently ...
FOSSACS
2000
Springer
13 years 8 months ago
2000
Springer
We relate several models of concurrency introduced in the literature in order to extend classical Mazurkiewicz traces. These are mainly Droste's concurrent automata and Arnold...
CORR
2010
Springer
13 years 2 months ago
2010
Springer
In a previous work we introduced slice graphs as a way to specify both infinite languages of directed acyclic graphs (DAGs) and infinite languages of partial orders. Therein we fo...