{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,6]],"date-time":"2025-11-06T19:49:37Z","timestamp":1762458577288},"publisher-location":"Berlin, Heidelberg","reference-count":20,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540440437"},{"type":"electronic","value":"9783540456940"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2002]]},"DOI":"10.1007\/3-540-45694-5_13","type":"book-chapter","created":{"date-parts":[[2007,10,5]],"date-time":"2007-10-05T07:44:18Z","timestamp":1191570258000},"page":"177-192","source":"Crossref","is-referenced-by-count":18,"title":["Safe Realizability of High-Level Message Sequence Charts*"],"prefix":"10.1007","author":[{"given":"Markus","family":"Lohrey","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2002,9,18]]},"reference":[{"key":"13_CR1","doi-asserted-by":"crossref","unstructured":"R. Alur, K. Etessami, and M. Yannakakis. Inference of message sequence charts. In Proceedings of the 22nd International Conference on on Software Engineering (ICSE 2000), Limerick (Ireland), pages 304\u2013313. ACM Press, 2000.","DOI":"10.1145\/337180.337215"},{"key":"13_CR2","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"797","DOI":"10.1007\/3-540-48224-5_65","volume-title":"Realizability and verification of MSC graphs","author":"R. Alur","year":"2001","unstructured":"R. Alur, K. Etessami, and M. Yannakakis. Realizability and verification of MSC graphs. In Proceedings of the 28th International Colloquium on Automata, Languages and Programming (ICALP 2001), Crete (Greece), number 2076 in Lecture Notes in Computer Science, pages 797\u2013808. Springer, 2001."},{"key":"13_CR3","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"114","DOI":"10.1007\/3-540-48320-9_10","volume-title":"Model checking of message sequence charts","author":"R. Alur","year":"1999","unstructured":"R. Alur and M. Yannakakis. Model checking of message sequence charts. In Proceedings of the 9th International Conference on Concurrency Theory (CONCUR 99), Eindhoven (The Netherlands), number 1664 in Lecture Notes in Computer Science, pages 114\u2013129. Springer, 1999."},{"key":"13_CR4","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"259","DOI":"10.1007\/BFb0035393","volume-title":"Syntactic detection of process divergence and nonlocal choice in message sequence charts","author":"H. Ben-Abdallah","year":"1997","unstructured":"H. Ben-Abdallah and S. Leue. Syntactic detection of process divergence and nonlocal choice in message sequence charts. In Proceedings of the Third International Workshop on Tools and Algorithms for Construction and Analysis of Systems (TACAS\u201997), Enschede (The Netherlands), number 1217 in Lecture Notes in Computer Science, pages 259\u2013274, 1997."},{"issue":"2","key":"13_CR5","doi-asserted-by":"crossref","first-page":"323","DOI":"10.1145\/322374.322380","volume":"30","author":"D. Brand","year":"1983","unstructured":"D. Brand and P. Zafiropulo. On communicating finite-state machines. Journal of the Association for Computing Machinery, 30(2):323\u2013342, 1983.","journal-title":"Journal of the Association for Computing Machinery"},{"key":"13_CR6","series-title":"Lect Notes Comput Sci","doi-asserted-by":"publisher","first-page":"125","DOI":"10.1007\/3-540-45510-8_5","volume-title":"Modelling and Verification of Parallel Processes (MOVEP), Nantes (France)","author":"B. Caillaud","year":"2000","unstructured":"B. Caillaud, P. Darondeau, L. H\u00e9lou\u00ebt, and G. Lesventes. HMSCs as partial specifications... with Petri nets as completion. In Modelling and Verification of Parallel Processes (MOVEP), Nantes (France), number 2067 in Lecture Notes in Computer Science, pages 125\u2013152, 2000."},{"volume-title":"The Book of Traces","year":"1995","key":"13_CR7","unstructured":"V. Diekert and G. Rozenberg, editors. The Book of Traces. World Scientific, Singapore, 1995."},{"key":"13_CR8","doi-asserted-by":"crossref","unstructured":"B. Genest, A. Muscholl, H. Seidl, and M. Zeitoun. Infinite-state high-level MSCs: Model-checking and realizability. to appear in Proceedings of the 29th International Colloquium on Automata, Languages and Programming (ICALP 2002), Malaga (Spain), 2002.","DOI":"10.1007\/3-540-45465-9_56"},{"key":"13_CR9","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"496","DOI":"10.1007\/3-540-45319-9_34","volume-title":"Compositional message sequence charts","author":"E. Gunter","year":"2001","unstructured":"E. Gunter, A. Muscholl, and D. Peled. Compositional message sequence charts. In T. Margaria and W. Yi, editors, Tools and Algorithms for the Construction and Analysis of Systems, 7th International Conference (TACAS), Genova (Italy), volume 2031 of Lecture Notes in Computer Science, pages 496\u2013511. Springer, 2001."},{"key":"13_CR10","unstructured":"L. H\u00e9lou\u00ebt and C. Jard. Conditions for synthesis of communicating automata from HMSCs. In 5th International Workshop on Formal Methods for Industrial Critical Systems (FMICS), Berlin (Germany), 2000."},{"key":"13_CR11","unstructured":"L. H\u00e9lou\u00ebt and P. Le Maigat. Decomposition of message sequence charts. In 2nd Workshop on SDL and MSC (SAM 2000), Grenoble (France), pages 46\u201360, 2000."},{"key":"13_CR12","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"675","DOI":"10.1007\/3-540-45022-X_57","volume-title":"Regular collections of message sequence charts","author":"J. G. Henriksen","year":"2000","unstructured":"J. G. Henriksen, M. Mukund, K. N. Kumar, and P. Thiagarajan. Regular collections of message sequence charts. In U. Montanari, J. D. P. Rolim, and E. Welzl, editors, Proceedings of the 25th International Symposium onMathematical Foundations of Computer Science (MFCS\u20192000), Bratislava, (Slovakia), number 1893 in Lecture Notes in Computer Science, pages 675\u2013686. Springer, 2000."},{"key":"13_CR13","unstructured":"ITU. Recommendation Z.100. Specification and Description Language (SDL). 1994."},{"key":"13_CR14","unstructured":"ITU. Recommendation Z.120. Message Sequence Charts. 1996."},{"key":"13_CR15","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"523","DOI":"10.1007\/3-540-45841-7_43","volume-title":"Recognizable sets of message sequence charts","author":"R. Morin","year":"2002","unstructured":"R. Morin. Recognizable sets of message sequence charts. In H. Alt and A. Ferreira, editors, Proceedings of the19th Annual Symposium on Theoretical Aspects of Computer Science (STACS 2002), Juan les Pins (France), number 2285 in Lecture Notes in Computer Science, pages 523\u2013534. Springer, 2002."},{"key":"13_CR16","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"81","DOI":"10.1007\/3-540-48340-3_8","volume-title":"Message sequence graphs and decision problems on Mazurkiewicz trace","author":"A. Muscholl","year":"1999","unstructured":"A. Muscholl and D. Peled. Message sequence graphs and decision problems on Mazurkiewicz trace. In M. Kutylowski, L. Pacholski, and T. Wierzbicki, editors, Proceedings of the 24th Mathematical Foundations of Computer Science (MFCS\u201999), Szklarska Poreba (Poland), number 1672 in Lecture Notes in Computer Science, pages 81\u201391. Springer, 1999."},{"key":"13_CR17","unstructured":"C. H. Papadimitriou. Computational Complexity. Addison Wesley, 1994."},{"key":"13_CR18","first-page":"361","volume":"2","author":"G. Bochmann von","year":"1978","unstructured":"G. von Bochmann. Finite state description of communication protocols. Computer Networks, 2:361\u2013372, 1978.","journal-title":"Computer Networks"},{"key":"13_CR19","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"140","DOI":"10.1007\/BFb0055048","volume-title":"Difficult configurations\u2014 on the complexity of LTrL","author":"I. Walukiewicz","year":"1998","unstructured":"I. Walukiewicz. Difficult configurations\u2014 on the complexity of LTrL. In Proceedings of the25th International Colloquium on Automata, Languages and Programming (ICALP 98), Aalborg (Denmark), number 1443 in Lecture Notes in Computer Science, pages 140\u2013151. Springer, 1998."},{"key":"13_CR20","first-page":"99","volume":"27","author":"W. Zielonka","year":"1985","unstructured":"W. Zielonka. Notes on finite asynchronous automata. R. A. I. R. O.\u2014 Informatique Th\u00e9orique et Applications, 27:99\u2013135, 1985.","journal-title":"R. A. I. R. O.\u2014 Informatique Th\u00e9orique et Applications"}],"container-title":["Lecture Notes in Computer Science","CONCUR 2002 \u2014 Concurrency Theory"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-45694-5_13","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,3]],"date-time":"2019-05-03T15:06:33Z","timestamp":1556895993000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-45694-5_13"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2002]]},"ISBN":["9783540440437","9783540456940"],"references-count":20,"URL":"https:\/\/doi.org\/10.1007\/3-540-45694-5_13","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2002]]}}}