{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T23:21:00Z","timestamp":1725492060020},"publisher-location":"Berlin, Heidelberg","reference-count":12,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540756972"},{"type":"electronic","value":"9783540756989"}],"license":[{"start":{"date-parts":[[2007,1,1]],"date-time":"2007-01-01T00:00:00Z","timestamp":1167609600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2007]]},"DOI":"10.1007\/978-3-540-75698-9_22","type":"book-chapter","created":{"date-parts":[[2007,10,3]],"date-time":"2007-10-03T22:26:03Z","timestamp":1191450363000},"page":"334-349","source":"Crossref","is-referenced-by-count":2,"title":["Strong Safe Realizability of Message Sequence Chart Specifications"],"prefix":"10.1007","author":[{"given":"Abdolmajid","family":"Mousavi","sequence":"first","affiliation":[]},{"given":"Behrouz","family":"Far","sequence":"additional","affiliation":[]},{"given":"Armin","family":"Eberlein","sequence":"additional","affiliation":[]},{"given":"Behrouz","family":"Heidari","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"22_CR1","unstructured":"ITU: Recommendation Z.120: Message Sequence Chart(MSC), Geneva (1996)"},{"issue":"7","key":"22_CR2","doi-asserted-by":"publisher","first-page":"623","DOI":"10.1109\/TSE.2003.1214326","volume":"29","author":"R. Alur","year":"2003","unstructured":"Alur, R., Etessami, K., Yannakakis, M.: Inference of Message Sequence Charts. IEEE Transaction on Software Engineering\u00a029(7), 623\u2013633 (2003)","journal-title":"IEEE Transaction on Software Engineering"},{"key":"22_CR3","series-title":"Lecture Notes in Computer Science","first-page":"1","volume-title":"Fundamental Approaches to Software Engineering","author":"H. Muccini","year":"2003","unstructured":"Muccini, H.: Detecting implied scenarios analyzing non-local branching choice. In: Pezz\u00e9, M. (ed.) ETAPS 2003 and FASE 2003. LNCS, vol.\u00a02621, pp. 1\u201315. Springer, Heidelberg (2003)"},{"key":"22_CR4","unstructured":"Uchitel, S.: Incremental Elaboration of Scenario-Based Specifications and Behaviour Models Using Implied Scenarios. PhD thesis, PhD Thesis, Imperial College, London (2003)"},{"key":"22_CR5","first-page":"109","volume-title":"FSE\u201902","author":"S. Uchitel","year":"2002","unstructured":"Uchitel, S., Kramer, J., Magee, J.: Negative scenarios for implied scenario elicitation. In: FSE 2002. 10th ACM SIGSOFT International Symposium on the Foundations of Software Engineering, pp. 109\u2013118. ACM Press, New York (2002)"},{"key":"22_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"273","DOI":"10.1007\/978-3-540-31984-9_21","volume-title":"Fundamental Approaches to Software Engineering","author":"A. Mooij","year":"2005","unstructured":"Mooij, A., Goga, N., Romijn, J.: Non-local choice and beyond: Intricacies of MSC choice nodes. In: Cerioli, M. (ed.) FASE 2005. LNCS, vol.\u00a03442, pp. 273\u2013288. Springer, Heidelberg (2005)"},{"key":"22_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"259","DOI":"10.1007\/BFb0035393","volume-title":"Tools and Algorithms for the Construction and Analysis of Systems","author":"H. Ben-Abdhallah","year":"1997","unstructured":"Ben-Abdhallah, H., Leue, S.: Syntactic detection of process divergence and non-local choice in Message Sequence Charts. In: Brinksma, E. (ed.) TACAS 1997. LNCS, vol.\u00a01217, pp. 259\u2013274. Springer, Heidelberg (1997)"},{"issue":"1","key":"22_CR8","doi-asserted-by":"publisher","first-page":"97","DOI":"10.1016\/j.tcs.2004.09.034","volume":"331","author":"R. Alur","year":"2005","unstructured":"Alur, R., Etessami, K., Yannakakis, M.: Realizability and verification of MSC graphs. Theoretical Computer Science\u00a0331(1), 97\u2013114 (2005)","journal-title":"Theoretical Computer Science"},{"key":"22_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"177","DOI":"10.1007\/3-540-45694-5_13","volume-title":"CONCUR 2002 - Concurrency Theory","author":"M. Lohery","year":"2002","unstructured":"Lohery, M.: Safe realizability of high-Level Message Sequence Charts. In: Brim, L., Jan\u010dar, P., K\u0159et\u00ednsk\u00fd, M., Kucera, A. (eds.) CONCUR 2002. LNCS, vol.\u00a02421, pp. 177\u2013192. Springer, Heidelberg (2002)"},{"key":"22_CR10","unstructured":"Mousavi, A., Far, B., Eberlein, A.: The Problematic Property of Choice Nodes in high-level Message Sequence Charts. Technical report, Laboratory for Agent-Based Software Engineering, University of Calgary (2006), \n                  \n                    http:\/\/www.enel.ucalgary.ca\/~amousavi\/reports\/choice_nodes.pdf"},{"key":"22_CR11","volume-title":"Introduction to Automata Theory, Languages, and Computation","author":"J. Hopcroft","year":"2001","unstructured":"Hopcroft, J., Motwani, R., Ullman, J.: Introduction to Automata Theory, Languages, and Computation, 2nd edn. Addison-Wesley Publishing Company, Reading (2001)","edition":"2"},{"key":"22_CR12","series-title":"Lecture Notes in Computer Science","volume-title":"Computer Aided Verification","author":"C. Fournet","year":"2004","unstructured":"Fournet, C., Hoare, C., Rajamani, S., Rehof, J.: Stuck-free conformance. In: Alur, R., Peled, D.A. (eds.) CAV 2004. LNCS, vol.\u00a03114, Springer, Heidelberg (2004)"}],"container-title":["Lecture Notes in Computer Science","International Symposium on Fundamentals of Software Engineering"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-75698-9_22","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,19]],"date-time":"2019-05-19T10:35:15Z","timestamp":1558262115000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-75698-9_22"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2007]]},"ISBN":["9783540756972","9783540756989"],"references-count":12,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-75698-9_22","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2007]]}}}