Mixed product and asynchronous automata
Theoretical Computer Science
Bounded time-stamping in message-passing systems
Theoretical Computer Science
Compositional Message Sequence Charts
TACAS 2001 Proceedings of the 7th International Conference on Tools and Algorithms for the 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
Deciding Properties for Message Sequence Charts
FoSSaCS '98 Proceedings of the First International Conference on Foundations of Software Science and Computation Structure
HMSCs as partial specifications ... with PNs as completions
Modeling and verification of parallel processes
Information and Computation
A theory of regular MSC languages
Information and Computation
Infinite-state high-level MSCs: Model-checking and realizability
Journal of Computer and System Sciences
A Kleene theorem and model checking algorithms for existentially bounded communicating automata
Information and Computation
Causal Message Sequence Charts
Theoretical Computer Science
| Hi-index | 0.00 |
An effective way to assemble partial views of a distributed system is to compute their product. Given twoMessage Sequence Graphs, we address the problem of computing a Message Sequence Graph that generates the product of their languages, when possible. Since all MSCs generated by a Message Sequence Graph G may be run within fixed bounds on the message channels (that is, G is existentially bounded), a subproblem is to decide whether the considered product is existentially bounded. We show that this question is undecidable, but turns co-NP-complete in the restricted case where all synchronizations belong to the same process. This is the first positive result on the decision of existential boundedness. We propose sufficient conditions under which a Message Sequence Graph representing the product can be constructed.