{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,1,18]],"date-time":"2025-01-18T07:10:02Z","timestamp":1737184202515,"version":"3.33.0"},"publisher-location":"Berlin, Heidelberg","reference-count":15,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540433668"},{"type":"electronic","value":"9783540459316"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2002]]},"DOI":"10.1007\/3-540-45931-6_5","type":"book-chapter","created":{"date-parts":[[2007,6,9]],"date-time":"2007-06-09T04:53:52Z","timestamp":1181364832000},"page":"52-66","source":"Crossref","is-referenced-by-count":0,"title":["Generalised Regular MSC Languages"],"prefix":"10.1007","author":[{"given":"Benedikt","family":"Bollig","sequence":"first","affiliation":[]},{"given":"Martin","family":"Leucker","sequence":"additional","affiliation":[]},{"given":"Thomas","family":"Noll","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2002,3,15]]},"reference":[{"key":"5_CR1","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"114","DOI":"10.1007\/3-540-48320-9_10","volume-title":"Proceedings of the 10th International Conference on Concurrency Theory","author":"R. Alur","year":"1999","unstructured":"R. Alur and M. Yannakakis. Model checking of message sequence charts. In Proceedings of the 10th International Conference on Concurrency Theory, volume 1664 of Lecture Notes in Computer Science, pages 114\u2013129. Springer, 1999."},{"key":"5_CR2","volume-title":"ACM SIGPLAN Notices","author":"J. Ara\u00fajo","year":"1998","unstructured":"Jo\u00e3o Ara\u00fajo. Formalizing sequence diagrams. In Proceedings of the OOPSLA\u201998 Workshop on Formalizing UML. Why? How?, volume 33, 10 of ACM SIGPLAN Notices, New York, 1998. ACM Press."},{"key":"5_CR3","doi-asserted-by":"crossref","unstructured":"Benedikt Bollig and Martin Leucker. Modelling, Specifying, and Verifying Message Passing Systems. In Claudio Bettini and Angelo Montanari, editors, Proceedings of the Symposium on Temporal Representation and Reasoning (TIME\u201901), pages 240\u2013248. IEEE Computer Society Press, June 2001.","DOI":"10.1109\/TIME.2001.930723"},{"key":"5_CR4","doi-asserted-by":"crossref","unstructured":"Benedikt Bollig, Martin Leucker, and Thomas Noll. Generalised Regular MSC Languages. Technical Report AIB-03-2002, RWTH Aachen, January 2002.","DOI":"10.1007\/3-540-45931-6_5"},{"key":"5_CR5","volume-title":"Handbook on Formal Languages","author":"V. Diekert","year":"1997","unstructured":"Volker Diekert and Yves M\u00e9tivier. Partial commutation and traces. In G. Rozenberg and A. Salomaa, editors, Handbook on Formal Languages, volume III. Springer, Berlin-Heidelberg-New York, 1997."},{"key":"5_CR6","series-title":"Lect Notes Comput Sci","doi-asserted-by":"publisher","first-page":"496","DOI":"10.1007\/3-540-45319-9_34","volume-title":"Proceedings of the 7th International Conference on Tools and Algorithms for the Construction and Analysis of Systems (TACAS\u201901)","author":"E. Gunter","year":"2001","unstructured":"Elsa Gunter, Anca Muscholl, and Doron Peled. Compositional message sequence charts. In Tiziana Margaria and Wang Yi, editors, Proceedings of the 7th International Conference on Tools and Algorithms for the Construction and Analysis of Systems (TACAS\u201901), volume 2031 of Lecture Notes in Computer Science, pages 496\u2013511. Springer, April 2001."},{"key":"5_CR7","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"405","DOI":"10.1007\/3-540-44612-5_36","volume-title":"Proceedings of 25th International Symposium on Mathemtical Foundations of Computer Science (MFCS\u20192000)","author":"J. G. Henriksen","year":"2000","unstructured":"J. G. Henriksen, M. Mukund, K. Narayan Kumar, and P. S. Thiagarajan. Regular collections of message sequence charts. In Proceedings of 25th International Symposium on Mathemtical Foundations of Computer Science (MFCS\u20192000), volume 1893 of Lecture Notes in Computer Science, pages 405\u2013414. Springer, 2000."},{"key":"5_CR8","unstructured":"ITU-TS. ITU-TS Recommendation Z.120anb: Formal Semantics of Message Sequence Charts. Technical report, ITU-TS, Geneva, 1998."},{"key":"5_CR9","unstructured":"ITU-TS. ITU-TS Recommendation Z.120: Message Sequence Chart 1999 (MSC99). Technical report, ITU-TS, Geneva, 1999."},{"issue":"2","key":"5_CR10","doi-asserted-by":"publisher","first-page":"329","DOI":"10.1016\/0304-3975(94)90242-9","volume":"134","author":"M. Kaminski","year":"1994","unstructured":"Michael Kaminski and Nissim Francez. Finite-memory automata. Theoretical Computer Science, 134(2):329\u2013363, November 1994.","journal-title":"Theoretical Computer Science"},{"key":"5_CR11","series-title":"Lect Notes Comput Sci","volume-title":"Proceedings of the 19th International Symposium on Theoretical Aspects of Computer Science (STACS\u201902)","author":"D. Kuske","year":"2002","unstructured":"Dietrich Kuske. Another step towards a theory of regular MSC languages. In Proceedings of the 19th International Symposium on Theoretical Aspects of Computer Science (STACS\u201902), 2002, Lecture Notes in Computer Science. Springer, 2002."},{"key":"5_CR12","series-title":"Lect Notes Comput Sci","volume-title":"Proceedings of the 21st Conference on Foundations of Software Technology and Theoretical Computer Science","author":"P. Madhusudan","year":"2001","unstructured":"P. Madhusudan and B. Meenakshi. Beyond message sequence graphs. In Proceedings of the 21st Conference on Foundations of Software Technology and Theoretical Computer Science, Lecture Notes in Computer Science. Springer, 2001."},{"key":"5_CR13","doi-asserted-by":"crossref","unstructured":"M. Mukund, K. Narayan Kumar, and M. Sohoni. Keeping track of the latest gossip in message-passing systems. Technical Report TCS-95-3, School of Mathematics, SPIC Science Foundation, Madras, India, 1995.","DOI":"10.1007\/978-1-4471-3078-9_17"},{"key":"5_CR14","series-title":"Lect Notes Comput Sci","volume-title":"Proceedings of 26th International Symposium on Mathematical Foundations of Computer Science (MFCS\u201901)","author":"F. Neven","year":"2001","unstructured":"Frank Neven, Thomas Schwentick, and Victor Vianu. Towards regular languages over in.nite alphabets. In Proceedings of 26th International Symposium on Mathematical Foundations of Computer Science (MFCS\u201901), Lecture Notes in Computer Science. Springer, 2001."},{"key":"5_CR15","first-page":"99","volume":"21","author":"W. Zielonka","year":"1987","unstructured":"WiesLlaw Zielonka. Notes on finite asynchronous automata. R.A.I.R.O. \u2014 Informatique Th\u00e9orique et Applications, 21:99\u2013135, 1987.","journal-title":"R.A.I.R.O. \u2014 Informatique Th\u00e9orique et Applications"}],"container-title":["Lecture Notes in Computer Science","Foundations of Software Science and Computation Structures"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-45931-6_5","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,1,17]],"date-time":"2025-01-17T04:20:12Z","timestamp":1737087612000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-45931-6_5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2002]]},"ISBN":["9783540433668","9783540459316"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/3-540-45931-6_5","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2002]]}}}