Tutorial on message sequence charts
Computer Networks and ISDN Systems - Special issue on SDL and MSC
On Communicating Finite-State Machines
Journal of the ACM (JACM)
Dynamic Message Sequence Charts
FST TCS '02 Proceedings of the 22nd Conference Kanpur on Foundations of Software Technology and Theoretical Computer Science
Realizability of high-level message sequence charts: closing the gaps
Theoretical Computer Science
Realizability and verification of MSC graphs
Theoretical Computer Science - Automata, languages and programming
Infinite-state high-level MSCs: Model-checking and realizability
Journal of Computer and System Sciences
Verification of well-formed communicating recursive state machines
Theoretical Computer Science
Causal Message Sequence Charts
Theoretical Computer Science
A theory of regular MSC languages
Information and Computation
Causal closure for MSC languages
FSTTCS '05 Proceedings of the 25th international conference on Foundations of Software Technology and Theoretical Computer Science
An automaton over data words that captures EMSO logic
CONCUR'11 Proceedings of the 22nd international conference on Concurrency theory
Model checking languages of data words
FOSSACS'12 Proceedings of the 15th international conference on Foundations of Software Science and Computational Structures
| Hi-index | 0.00 |
We introduce dynamic communicating automata (DCA), an extension of communicating finite-state machines that allows for dynamic creation of processes. Their behavior can be described as sets of message sequence charts (MSCs). We consider the realizability problem for DCA: given a dynamic MSC grammar (a high-level MSC specification), is there a DCA defining the same set of MSCs? We show that this problem is decidable in doubly exponential time, and identify a class of realizable grammars that can be implemented by finite DCA.