{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,1,16]],"date-time":"2025-01-16T21:40:08Z","timestamp":1737063608886,"version":"3.33.0"},"publisher-location":"Berlin, Heidelberg","reference-count":23,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540000105"},{"type":"electronic","value":"9783540360780"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2002]]},"DOI":"10.1007\/3-540-36078-6_5","type":"book-chapter","created":{"date-parts":[[2007,6,1]],"date-time":"2007-06-01T02:48:36Z","timestamp":1180666116000},"page":"68-85","source":"Crossref","is-referenced-by-count":2,"title":["Extending Compositional Message Sequence Graphs"],"prefix":"10.1007","author":[{"given":"Benedikt","family":"Bollig","sequence":"first","affiliation":[]},{"given":"Martin","family":"Leucker","sequence":"additional","affiliation":[]},{"given":"Philipp","family":"Lucas","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2002,10,24]]},"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":"Proc. 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 Proc. of the 10th International Conference on Concurrency Theory, LNCS 1664, pp. 114\u2013129. Springer, 1999."},{"key":"5_CR2","unstructured":"J. Ara\u00fajo. Formalizing sequence diagrams. In L. Andrade, A. Moreira, A. Deshpande, and S. Kent, editors, Proc. of the OOPSLA\u2019 98 Workshop on Formalizing UML. Why? How?, volume 33, 10 of A CM SIGPLAN Notices, New York, 1998. ACM Press."},{"key":"5_CR3","doi-asserted-by":"crossref","unstructured":"B. Bollig and M. Leucker. Deciding LTL over Mazurkiewicz traces. In C. Bettini and A. Montanari, editors, Proc. of the Symposium on Temporal Representation and Reasoning (TIME\u201901), pp. 189\u2013197. IEEE Computer Society Press, 2001.","DOI":"10.1109\/TIME.2001.930717"},{"key":"5_CR4","doi-asserted-by":"crossref","unstructured":"B. Bollig and M. Leucker. Modelling, Specifying, and Verifying Message Passing Systems. In C. Bettini and A. Montanari, editors, Proc. of the Symposium on Temporal Representation and Reasoning (TIME\u201901), pp. 240\u2013248. IEEE Computer Society Press, 2001.","DOI":"10.1109\/TIME.2001.930723"},{"key":"5_CR5","doi-asserted-by":"crossref","unstructured":"B. Bollig, M. Leucker, and P. Lucas. Extending compositional message sequence graphs. Technical Report MS-CIS-02-09, University of Pennsylvania, Apr. 2002.","DOI":"10.1007\/3-540-36078-6_5"},{"key":"5_CR6","series-title":"Lect Notes Comput Sci","doi-asserted-by":"publisher","first-page":"52","DOI":"10.1007\/3-540-45931-6_5","volume-title":"Proc. of the 5th International Conference on Foundations of Software Science and Computation Structures (FOSSACS\u2019 02)","author":"B. Bollig","year":"2002","unstructured":"B. Bollig, M. Leucker, and T. Noll. Generalised regular MSC languages. In Proc. of the 5th International Conference on Foundations of Software Science and Computation Structures (FOSSACS\u2019 02), LNCS 2303, pp. 52\u201366. Springer, 2002."},{"key":"5_CR7","unstructured":"W. Damm and D. Harel. LSC\u2019s: Breathing life into message sequence charts. Technical Report CS98-09, Weizmann Institute of Science, Apr. 1998."},{"key":"5_CR8","doi-asserted-by":"crossref","unstructured":"V. Diekert and Y. M\u00e9tivier. Partial commutation and traces. In G. Rozenberg and A. Salomaa, editors, Handbook on Formal Languages, volume III. Springer, 1997.","DOI":"10.1007\/978-3-642-59126-6_8"},{"key":"5_CR9","series-title":"Lect Notes Comput Sci","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-45319-9_34","volume-title":"Proc. of the 7th International Conference on Tools and Algorithms for the Construction and Analysis of Systems (TACAS\u201901)","author":"E. Gunter","year":"2001","unstructured":"E. Gunter, A. Muscholl, and D. Peled. Compositional message sequence charts. In T. Margaria and W. Yi, editors, Proc. of the 7th International Conference on Tools and Algorithms for the Construction and Analysis of Systems (TACAS\u201901), LNCS 2031. Springer, Apr. 2001."},{"key":"5_CR10","series-title":"Lect Notes Comput Sci","doi-asserted-by":"publisher","first-page":"675","DOI":"10.1007\/3-540-45022-X_57","volume-title":"Proc. of 27th International Colloquium on Automata, Languages and Programming (ICALP\u20192000)","author":"J. G. Henriksen","year":"2000","unstructured":"J. G. Henriksen, M. Mukund, K. N. Kumar, and P. S. Thiagarajan. On message sequence graphs and finitely generated regular msc languages. In Proc. of 27th International Colloquium on Automata, Languages and Programming (ICALP\u20192000), LNCS 1853, pp. 675\u2013686. Springer, 2000."},{"key":"5_CR11","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"405","DOI":"10.1007\/3-540-44612-5_36","volume-title":"Proc. of 25th International Symposium on Mathematical Foundations of Computer Science (MFCS\u20192000)","author":"J. G. Henriksen","year":"2000","unstructured":"J. G. Henriksen, M. Mukund, K. N. Kumar, and P. S. Thiagarajan. Regular collections of message sequence charts. In Proc. of 25th International Symposium on Mathematical Foundations of Computer Science (MFCS\u20192000), LNCS 1893, pp. 405\u2013414. Springer, 2000."},{"key":"5_CR12","volume-title":"Technical report","author":"ITU-TS.","year":"1998","unstructured":"ITU-TS. ITU-TS Recommendation Z.120anb: Formal Semantics of Message Sequence Charts. Technical report, ITU-TS, Geneva, 1998."},{"key":"5_CR13","volume-title":"Technical report","author":"ITU-TS.","year":"1999","unstructured":"ITU-TS. ITU-TS Recommendation Z.120: Message Sequence Chart 1999 (MSC99). Technical report, ITU-TS, Geneva, 1999."},{"key":"5_CR14","series-title":"Lect Notes Comput Sci","volume-title":"Proc. of the 19th International Symposium on Theoretical Aspects of Computer Science (STACS\u201902)","author":"D. Kuske","year":"2002","unstructured":"D. Kuske. Another step towards a theory of regular MSC languages. In Proc. of the 19th International Symposium on Theoretical Aspects of Computer Science (STACS\u201902), LNCS 2285. Springer, 2002."},{"key":"5_CR15","series-title":"Lect Notes Comput Sci","volume-title":"Proc. of 27th International Colloquium on Automata, Languages and Programming (ICALP\u20192000)","author":"P. Madhusudan","year":"2001","unstructured":"P. Madhusudan. Reasoning about sequential and branching behaviours of message sequence graphs. In Proc. of 27th International Colloquium on Automata, Languages and Programming (ICALP\u20192000), LNCS 2076. Springer, 2001."},{"key":"5_CR16","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"256","DOI":"10.1007\/3-540-45294-X_22","volume-title":"Proc. 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 Proc. of the 21st Conference on Foundations of Software Technology and Theoretical Computer Science, LNCS 2245, pp. 256\u2013267. Springer, 2001."},{"key":"5_CR17","doi-asserted-by":"crossref","unstructured":"S. Mauw and M. A. Reniers. High-level message sequence charts. In Proc. of the Eighth SDL Forum (SDL\u201997), pp. 291\u2013306, 1997.","DOI":"10.1016\/B978-044482816-3\/50020-4"},{"key":"5_CR18","series-title":"Lect Notes Comput Sci","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-45022-X_41","volume-title":"Proc. of 27th International Colloquium on Automata, Languages and Programming (ICALP\u20192000)","author":"B. Meenakshi","year":"2000","unstructured":"B. Meenakshi and R. Ramanujam. Reasoning about message passing in finite state environments. In F. Orejas, P. G. Spirakis, and J. van Leeuwen, editors, Proc. of 27th International Colloquium on Automata, Languages and Programming (ICALP\u20192000), LNCS 1853. Springer, 2000."},{"key":"5_CR19","unstructured":"R. Milner. Communication and Concurrency. International Series in Computer Science. Prentice Hall, 1989."},{"key":"5_CR20","series-title":"Lect Notes Comput Sci","volume-title":"Proc. of the 19th International Symposium on Theoretical Aspects of Computer Science (STACS\u201902), 2002","author":"R. Morin","year":"2002","unstructured":"R. Morin. Recognizable sets of message sequence charts. In Proc. of the 19th International Symposium on Theoretical Aspects of Computer Science (STACS\u201902), 2002, LNCS 2285. Springer, 2002."},{"key":"5_CR21","doi-asserted-by":"crossref","unstructured":"D. Peled. Specification and verification of message sequence charts. In Proc. IFIP FORTE\/PSTV, pp. 139\u2013154, 2000.","DOI":"10.1007\/978-0-387-35533-7_9"},{"key":"5_CR22","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"438","DOI":"10.1007\/3-540-60218-6_33","volume-title":"Proc. of the 6th International Conference on Concurrency Theory (CONCUR\u201995)","author":"P. S. Thiagarajan","year":"1995","unstructured":"P. S. Thiagarajan. A trace consistent subset of PTL. In I. Lee and S. A. Smolka, editors, Proc. of the 6th International Conference on Concurrency Theory (CONCUR\u201995), LNCS 962, pp. 438\u2013452, Philadelphia, Pennsylvania, 1995. Springer."},{"key":"5_CR23","doi-asserted-by":"crossref","unstructured":"P. S. Thiagarajan and I. Walukiewicz. An expressively complete linear time temporal logic for Mazurkiewicz traces. In Proc. 12th Annual IEEE Symposium on Logic in Computer Science, Warsaw, Poland, 1997. IEEE Computer Society Press.","DOI":"10.1109\/LICS.1997.614946"}],"container-title":["Lecture Notes in Computer Science","Logic for Programming, Artificial Intelligence, and Reasoning"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-36078-6_5","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,1,16]],"date-time":"2025-01-16T21:00:03Z","timestamp":1737061203000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-36078-6_5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2002]]},"ISBN":["9783540000105","9783540360780"],"references-count":23,"URL":"https:\/\/doi.org\/10.1007\/3-540-36078-6_5","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2002]]}}}