Non-local choice and beyond: Intricacies of MSC choice nodes

Lecture Notes in Computer Science

Volumn 3442, Issue , 2005, Pages 273-288

  Mooij, Arjan J ^a   Goga, Nicolae ^a   Romijn, Judi M T ^a  

^a EINDHOVEN UNIVERSITY OF TECHNOLOGY   (Netherlands)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER PROGRAMMING; PROBLEM SOLVING; SEMANTICS;

AUTONOMOUS PROCESSES; MSC CHOICES; NON-LOCAL CHOICE; VISUAL FORMALIZM;

COMPUTER SCIENCE;

EID: 24644511824     PISSN: 03029743     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1007/978-3-540-31984-9_21     Document Type: Conference Paper

References (20)

1. J.C.M. Bateten and S. Mauw. Delayed choice: an operator for joining Message Sequence Charts. In Formal Description Techniques, pages 340-354, 1995.
2. H. Ben-Abdallah and S. Leue. Syntactic detection of process divergence and non-local choice in Message Sequence Charts. In Tools and Algorithms for the Construction and Analysis of Systems, number 1217 in LNCS, pages 259-274, 1997.
3. H. Brinksma. Constraint-oriented specification in a constructive specification technique. In REX Workshop on Stepwise Refinement of Distributed Systems, volume 430 of LNCS, pages 130-152, 1990.
4. A.G. Engels, S. Mauw, and M.A. Reniers. A hierarchy of communication models for message sequence charts. Science of Computer Programming, 44:253-292, 2002.
5. M.G. Gouda and Y.T. Yu. Synthesis of communicating finite-state machines with guaranteed progress. IEEE Transactions on Communications, COM-32(7):779-788, July 1984.
6. E.L. Gunter, A. Muscholl, and D.A. Peled. Compositional message sequence charts. In 7th Conference on Tools and Algorithms for the Construction and Analysis of Systems, volume 2031 of LNCS, pages 496-511. Springer, 2001.
7. L. Hélouët. Some pathological message sequence charts and how to detect them. In 10th SDL Forum, number 2078 in LNCS, pages 348-364, June 2001.
8. J.G. Henriksen, M. Mukund, K. Narayan Kumar, and P. S. Thiagarajan. Towards a theory of regular MSC languages. BRIGS Report RS-99-52, Department of Computer Science, Aarhus University, Denmark, 1999.
9. G.J. Holzmann. The model checker Spin. IEEE Transactions on Software Engineering, 23(5):279-295, May 1997.
10. International Standards Organization. Information Processing Systems - Open Systems Interconnection - LOTOS - A Formal Description Technique Based on the Temporal Ordering of Observational Behaviour, 1989. ISO 8807:1989.
11. ITU-T. Message sequence chart. Recommendation Z.120, ITU-T, 2000.
12. F. Khendek, G. Robert, G. Butler, and P. Grogono. Implementability of message sequence charts. In Workshop on SDL and MSC. SDL Forum Society, 1998.
13. M. Lohrey. Realizability of high-level message sequence charts: closing the gaps. Theoretical Computer Science, 309(1-3):529-554, 2003.
14. P. Madhusudan and B. Meenakshi. Beyond message sequence graphs. In 21st Conference on Foundations of Software Technology and Theoretical Computer Science, volume 2245 of LNCS, pages 256-267, 2001.
15. A.J. Mooij and N. Goga. Dealing with non-local choice in IEEE 1073.2's standard for remote control. In SAM 2004: SDL And MSC, LNCS 3319. To appear.
16. H. Muccini. Detecting implied scenarios analyzing non-local branching choices. In Fundamental Approaches to Software Engineering, number 2621 in LNCS, pages 372-386. Springer Verlag, 2003.
17. M.A. Reniers. Message Sequence Chart: Syntax and Semantics. PhD thesis, Technische Universiteit Eindhoven, June 1999.
18. S. Uchitel. Incremental Elaboration of Scenario-Based Specifications and Behaviour Models Using Implied Scenarios. PhD thesis, Faculty of Engineering of the University of London, February 2003.
19. S. Uchitel, J. Kramer, and J. Magee. Detecting implied scenarios in message sequence chart specifications. In Proceedings of the 8th European software engineering conference, pages 74-82. ACM Press, 2001.
20. S. Uchitel, J. Kramer, and J. Magee. Synthesis of behavioral models from scenarios. IEEE Transactions on Software Engineering, 29(2):99-115, February 2003.