Realizability criteria for compositional MSC

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 4019 LNCS, Issue , 2006, Pages 248-262

  Mooij, Arjan ^a   Romijn, Judi ^a   Wesselink, Wieger ^a  

^a EINDHOVEN UNIVERSITY OF TECHNOLOGY   (Netherlands)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER SYSTEM RECOVERY; PROBLEM SOLVING; SEMANTICS;

COMPOSITIONAL MSC; REALIZABILITY;

COMPUTER SCIENCE;

EID: 33746049185     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/11784180_20     Document Type: Conference Paper

References (15)

1. [AEY05] R. Alur, K. Etessami, and M. Yannakakis. Realizability and verification of MSC graphs. Theoretical Computer Science, 331:97-114, 2005.
2. [BAL97] H. Ben-Abdallah and S. Leue. Syntactic detection of process divergence and non-local choice in Message Sequence Charts. In Proceedings of TACAS'97, volume 1217 of LNCS, pages 259-274. Springer, 1997.
3. [BM95] J.C.M. Baeten and S. Mauw. Delayed choice: an operator for joining Message Sequence Charts. In Formal Description Techniques, pages 340-354, 1995.
4. [Gen05] B. Genest. Compositional Message Sequence Charts (CMSCs) are better to implement than MSCs. In Proceedings of TACAS'05, volume 3440 of LNCS, pages 429-440. Springer, 2005.
5. [GMP03] E.L. Gunter, A. Muscholl, and D.A. Peled. Compositional Message Sequence Charts. International Journal on Software Tools for Technology Transfer, 5(1):78-89, November 2003. An earlier version appeared at TACAS'01.
6. [Hey00] S. Heymer. A semantics for MSC based on Petri-Net components. In Proceedings of SAM'00: 2nd Workshop on SDL and MSC, 2000.
7. [HJ00] L. Hélouët and C. Jard. Conditions for synthesis of communicating automata from HMSCs. In Proceedings of 5th FMICS Workshop, 2000.
8. [KL98] J.-P. Katoen and L. Lambert. Pomsets for Message Sequence Charts. In Proceedings of SAM'98: 1st Workshop on SDL and MSC, 1998.
9. [MG05] A.J. Mooij and N. Goga. Dealing with non-local choice in IEEE 1073.2's standard for remote control. In Proceedings of SAM'04: 4th Workshop on SDL and MSC, volume 3319 of LNCS, pages 257-270. Springer, 2005.
10. [MGR05] A.J. Mooij, N. Goga, and J.M.T. Romijn. Non-local choice and beyond: Intricacies of MSC choice nodes. In Proceedings of FASE'05, volume 3442 of LNCS, pages 273-288. Springer, 2005.
11. [MM01] P. Madhusudan and B. Meenakshi. Beyond message sequence graphs. In Proceedings of FASE'01, LNCS 2245, pages 256-267. Springer, 2001.
12. [MRW06] A.J. Mooij, J.M.T. Romijn, and J.W. Wesselink. Realizability criteria for compositional MSC. Computer Science Report 06-11, Technische Universiteit Eindhoven, March 2006.
13. [Pra86] V. Pratt. Modelling concurrency with partial orders. International Journal of Parallel Programming, 15(1):33-71, 1986.
14. [Ren99] M.A. Reniers. Message Sequence Chart: Syntax and Semantics. PhD thesis, Technische Universiteit Eindhoven, June 1999.
15. [UKM03] S. Uchitel, J. Kramer, and J. Magee. Synthesis of behavioral models from scenarios. IEEE Transactions on Software Engineering, 29(2):99-115, 2003.