Realizability of collaboration-based service specifications

Proceedings - Asia-Pacific Software Engineering Conference, APSEC

Volumn , Issue , 2007, Pages 73-80

  Castejón, Humberto Nicolás ^a   Bræk, Rolv ^a   Von Bochmann, Gregor ^b  

^a NORWEGIAN UNIVERSITY OF SCIENCE AND TECHNOLOGY   (Norway)

^b UNIVERSITY OF OTTAWA   (Canada)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER SIMULATION LANGUAGES; FLOW INTERACTIONS; GRAPHIC METHODS; SOFTWARE ENGINEERING; SPECIFICATIONS; TECHNOLOGY; THEOREM PROVING;

(I ,J) CONDITIONS; ASIA PACIFIC; COMMUNICATING STATE MACHINE (CFSM); COMPOSITION OPERATORS; COMPOSITIONAL SPECIFICATION; INTERACTION DIAGRAMS; JOINT BEHAVIOR; POSSIBLE SOLUTIONS; REALIZABILITY; SERVICE SPECIFICATIONS; UML ACTIVITY DIAGRAMS;

UNIFIED MODELING LANGUAGE;

EID: 44949246357     PISSN: 15301362     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/APSEC.2007.79     Document Type: Conference Paper

References (18)

1. R. Alur, K. Etessami, and M. Yannakakis. Realizability and verification of MSC graphs. Theor. Comput. Sci., 331(1):97-114, 2005.
2. R. Alur, G. J. Holzmann, and D. Peled. An analyzer for message sequence charts. Software - Concepts and Tools, 17(2):70-77, 1996.
3. N. Baudru and R. Morin. Safe implementability of regular message sequence chart specifications. In ACIS 4th Intl. Conf. on Soft. Eng., Artificial Intelligence, Networking and Parallel/Distr. Comp. (SNPD'03), 2003.
4. H. Ben-Abdallah and S. Leue. Syntactic detection of process divergence and non-local choice in message sequence charts. In 2nd Int. WS on Tools and Algs. for the Construction and Analysis of Sys. (TACAS'97), 1997.
5. H. N. Castejón, G. Bochmann, and R. Bræk. Investigating the realizability of collaboration-based service specifications. Technical report, Avantel 3/2007 ISSN 1503-4097, NTNU, 2007.
6. H. N. Castejón and R. Bræk. Formalizing collaboration goal sequences for service choreography. In 26th Intl. Conf. on Formal Methods for Networked and Distr. Sys. (FORTE'06), volume 4229 of LNCS. Springer, 2006.
7. C.-A. Chen, S. Kalvala, and J. Sinclair. Race conditions in message sequence charts. In 3rd Asian Symposium on Programming Languages and Systems (APLAS'05), volume 3780 of LNCS. Springer, 2005.
8. B. Genest, A. Muscholl, H. Seidl, and M. Zeitoun. Infinite-state high-level mscs: Model-checking and realizability. J. Comput. Syst. Sci., 72(4):617-647, 2006.
9. M. G. Gouda and Y.-T. Yu. Synthesis of communicating finite state machines with guaranteed progress. IEEE Trans. on Commun., Com-32(7):779-788, July 1984.
10. L. Hélouët. Some pathological message sequence charts, and how to detect them. In 10th Intl. SDL Forum, volume 2078 of LNCS. Springer, 2001.
11. L. Hélouët and C. Jard. Conditions for synthesis of communicating automata from HMSCs. In 5th Intl. Workshop on Formal Methods for Industrial Critical Systems (FMICS'OO). GMD FOKUS, 2000.
12. F. Khendek and X. J. Zhang. From MSC to SDL: Overview and an application to the autonomous shuttle transport system. In Dagstuhl Workshop on Scenarios: Models, Transformations and Tools, 2003.
13. B. Mitchell. Resolving race conditions in asynchronous partial order scenarios. IEEE Trans. Softw. Eng., 31(9):767-784, 2005.
14. A. Mooij, J. Romijn, and W. Wesselink. Realizability criteria for compositional MSC. In 11th Intl. Conf. on Algebraic Methodology and Software Technology (AMAST'06), volume 4019 of LNCS. Springer, 2006.
15. A. J. Mooij, N. Goga, and J. Romijn. Non-local choice and beyond: Intricacies of MSC choice nodes. In Fundamental Approaches to Soft. Eng. (FASE'05), 2005.
16. OMG. UML 2.1.1 Superstructure Spec., February 2007.
17. S. Uchitel, J. Kramer, and J. Magee. Incremental elaboration of scenario-based specifications and behavior models using implied scenarios. ACM Trans. Softw. Eng. Methodol., 13(1):37-85, 2004.
18. G. von Bochmann and R. Gotzhein. Deriving protocol specifications from service specifications. In ACM SIGCOMM Symposium, 1986.