On Communicating Finite-State Machines
Journal of the ACM (JACM)
Triggered message sequence charts
Proceedings of the 10th ACM SIGSOFT symposium on Foundations of software engineering
Message Sequence Graphs and Decision Problems on Mazurkiewicz Traces
MFCS '99 Proceedings of the 24th International Symposium on Mathematical Foundations of Computer Science
Specification and Verification of Message Sequence Charts
FORTE/PSTV 2000 Proceedings of the FIP TC6 WG6.1 Joint International Conference on Formal Description Techniques for Distributed Systems and Communication Protocols (FORTE XIII) and Protocol Specification, Testing and Verification (PSTV XX)
Realizability and Verification of MSC Graphs
ICALP '01 Proceedings of the 28th 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
Syntactic Detection of Process Divergence and Non-local Choice inMessage Sequence Charts
TACAS '97 Proceedings of the Third International Workshop on Tools and Algorithms for Construction and Analysis of Systems
Model Checking of Message Sequence Charts
CONCUR '99 Proceedings of the 10th International Conference on Concurrency Theory
Safe Realizability of High-Level Message Sequence Charts
CONCUR '02 Proceedings of the 13th International Conference on Concurrency Theory
Beyond Message Sequence Graphs
FST TCS '01 Proceedings of the 21st Conference on Foundations of Software Technology and Theoretical Computer Science
Come, Let's Play: Scenario-Based Programming Using LSC's and the Play-Engine
Come, Let's Play: Scenario-Based Programming Using LSC's and the Play-Engine
Regular sets of infinite message sequence charts
Information and Computation
Information and Computation
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
On implementation of global concurrent systems with local asynchronous controllers
CONCUR 2005 - Concurrency Theory
Replaying play in and play out: synthesis of design models from scenarios by learning
TACAS'07 Proceedings of the 13th international conference on Tools and algorithms for the construction and analysis of systems
Deciding properties of message sequence charts
SMTT'03 Proceedings of the 2003 international conference on Scenarios: models, Transformations and Tools
Realizability criteria for compositional MSC
AMAST'06 Proceedings of the 11th international conference on Algebraic Methodology and Software Technology
MSCAN: a tool for analyzing MSC specifications
TACAS'06 Proceedings of the 12th international conference on Tools and Algorithms for the Construction and Analysis of Systems
| Hi-index | 0.01 |
Communicating Finite States Machines (CFMs) and Message Sequence Graphs (MSC-graphs for short) are two popular specification formalisms for communicating systems. MSC-graphs capture requirements (scenarios), hence they are the starting point of the design process. Implementing an MSC-graph means obtaining an equivalent deadlock-free CFM, since CFMs correspond to distributed message-passing algorithms. Several partial answers for the implementation have been proposed. E.g., local-choice MSC-graphs form a subclass of deadlock-free CFM: Testing equivalence with some local-choice MSC-graph is thus a partial answer to the implementation problem. Using Compositional MSCs, we propose a new algorithm which captures more implementable models than with MSCs. Furthermore, the size of the implementation is reduced by one exponential.