Modeling concurrency with partial orders
International Journal of Parallel Programming
Synthesis of Behavioral Models from Scenarios
IEEE Transactions on Software Engineering
Delayed choice: an operator for joining Message Sequence Charts
Proceedings of the 7th IFIP WG6.1 International Conference on Formal Description Techniques VII
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
Compositional Message Sequence Charts
TACAS 2001 Proceedings of the 7th International Conference on Tools and Algorithms for the Construction and Analysis of Systems
Beyond Message Sequence Graphs
FST TCS '01 Proceedings of the 21st Conference on Foundations of Software Technology and Theoretical Computer Science
Realizability and verification of MSC graphs
Theoretical Computer Science - Automata, languages and programming
Non-local choice and beyond: intricacies of MSC choice nodes
FASE'05 Proceedings of the 8th international conference, held as part of the joint European Conference on Theory and Practice of Software conference on Fundamental Approaches to Software Engineering
Compositional message sequence charts (CMSCs) are better to implement than MSCs
TACAS'05 Proceedings of the 11th international conference on Tools and Algorithms for the Construction and Analysis of Systems
Dealing with non-local choice in IEEE 1073.2's standard for remote control
SAM'04 Proceedings of the 4th international SDL and MSC conference on System Analysis and Modeling
Testing Systems Specified as Partial Order Input/Output Automata
TestCom '08 / FATES '08 Proceedings of the 20th IFIP TC 6/WG 6.1 international conference on Testing of Software and Communicating Systems: 8th International Workshop
On the realizability of collaborative services
Software and Systems Modeling (SoSyM)
| Hi-index | 0.00 |
Synthesizing a proper implementation for a scenario-based specification is often impossible, due to the distributed nature of implementations. To be able to detect problematic specifications, realizability criteria have been identified, such as non-local choice. In this work we develop a formal framework to study realizability of compositional MSC [GMP03]. We use it to derive a complete classification of criteria that is closely related to the criteria for MSC from [MGR05]. Comparing specifications and implementations is usually complicated, because different formalisms are used. We treat both of them in terms of a single formalism. Therefore we extend the partial order semantics of [Pra86, KL98] with a way to model deadlocks and with a more sophisticated way to address communication.