Modeling concurrency with partial orders
International Journal of Parallel Programming
On recognizable subsets of free partially commutative monoids
Theoretical Computer Science - Thirteenth International Colloquim on Automata, Languages and Programming, Renne
Time, clocks, and the ordering of events in a distributed system
Communications of the ACM
The Book of Traces
Message Sequence Graphs and Decision Problems on Mazurkiewicz Traces
MFCS '99 Proceedings of the 24th International Symposium on Mathematical Foundations of Computer Science
On Logics, Tilings, and Automata
ICALP '91 Proceedings of the 18th International Colloquium on Automata, Languages and Programming
Infinite-State High-Level MSCs: Model-Checking and Realizability
ICALP '02 Proceedings of the 29th International Colloquium on Automata, Languages and Programming
HMSCs as Partial Specifications ... with PNs as Completions
MOVEP '00 Proceedings of the 4th Summer School on Modeling and Verification of Parallel Processes
TACAs '96 Proceedings of the Second International Workshop on Tools and Algorithms for Construction and Analysis of Systems
Recognizable Sets of Message Sequence Charts
STACS '02 Proceedings of the 19th Annual Symposium on Theoretical Aspects of Computer Science
Model Checking of Message Sequence Charts
CONCUR '99 Proceedings of the 10th International Conference on Concurrency Theory
On Regular Message Sequence Chart Languages and Relationships to Mazurkiewicz Trace Theory
FoSSaCS '01 Proceedings of the 4th International Conference on Foundations of Software Science and Computation Structures
A theory of regular MSC languages
Information and Computation
A kleene theorem for a class of communicating automata with effective algorithms
DLT'04 Proceedings of the 8th international conference on Developments in Language Theory
Compositional synthesis of asynchronous automata
Theoretical Computer Science
Hi-index | 0.01 |
A netchart is basically a Petri net whose places are located at some process and whose transitions are labeled by message sequence charts (MSCs). Two recent papers showed independently that any globally-cooperative high-level MSC corresponds to the behaviors of some communicating finite-state machine — or equivalently a netchart. These difficult results rely either on Thomas’ graph acceptors or Zielonka’s construction of asynchronous automata. In this paper we give a direct and self-contained synthesis of netcharts from globally-cooperative high-level MSCs by means of a simpler unfolding procedure.