A note on the commutative closure of star-free languages
Information Processing Letters
Tutorial on message sequence charts
Computer Networks and ISDN Systems - Special issue on SDL and MSC
The Unified Modeling Language user guide
The Unified Modeling Language user guide
Introduction To Automata Theory, Languages, And Computation
Introduction To Automata Theory, Languages, And Computation
Message Sequence Graphs and Decision Problems on Mazurkiewicz Traces
MFCS '99 Proceedings of the 24th International Symposium on Mathematical Foundations of Computer Science
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
A Trace Consistent Subset of PTL
CONCUR '95 Proceedings of the 6th International Conference on Concurrency Theory
Decidability of reachability in vector addition systems (Preliminary Version)
STOC '82 Proceedings of the fourteenth annual ACM symposium on Theory of computing
Inference of Message Sequence Charts
IEEE Transactions on Software Engineering
Realizability and verification of MSC graphs
Theoretical Computer Science - Automata, languages and programming
A theory of regular MSC languages
Information and Computation
TESTCOM '09/FATES '09 Proceedings of the 21st IFIP WG 6.1 International Conference on Testing of Software and Communication Systems and 9th International FATES Workshop
Global and local testing from Message Sequence Charts
Proceedings of the 27th Annual ACM Symposium on Applied Computing
| Hi-index | 0.00 |
Message sequence charts are an attractive formalism for specifying communicating systems. One way to test such a system is to substitute a component by a test process and observe its interaction with the rest of the system. Unfortunately, local observations can combine in unexpected ways to define implied scenarios not present in the original specification. Checking whether a scenario specification is closed with respect to implied scenarios is known to be undecidable when observations are made one process at a time. We show that even if we strengthen the observer to be able to observe multiple processes simultaneously, the problem remains undecidable. In fact, undecidability continues to hold even without message labels, provided we observe two or more processes simultaneously. On the other hand, without message labels, if we observe one process at a time, checking for implied scenarios is decidable.