{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,17]],"date-time":"2026-03-17T03:15:20Z","timestamp":1773717320373,"version":"3.50.1"},"reference-count":29,"publisher":"Elsevier BV","issue":"17","license":[{"start":{"date-parts":[[1999,6,1]],"date-time":"1999-06-01T00:00:00Z","timestamp":928195200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Computer Networks"],"published-print":{"date-parts":[[1999,6]]},"DOI":"10.1016\/s1389-1286(99)00060-2","type":"journal-article","created":{"date-parts":[[2002,7,26]],"date-time":"2002-07-26T02:57:10Z","timestamp":1027652230000},"page":"1785-1799","source":"Crossref","is-referenced-by-count":31,"title":["Operational Semantics for MSC'96"],"prefix":"10.1016","volume":"31","author":[{"given":"S.","family":"Mauw","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"M.A.","family":"Reniers","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/S1389-1286(99)00060-2_BIB1","doi-asserted-by":"crossref","unstructured":"R. Alur, G.J. Holzmann, D. Peled, An analyzer for Message Sequence Charts, Software - Concepts and Tools 17 (2) (1996) 70\u201377.","DOI":"10.1007\/3-540-61042-1_37"},{"key":"10.1016\/S1389-1286(99)00060-2_BIB2","doi-asserted-by":"crossref","unstructured":"J.C.M. Baeten, S. Mauw, Delayed choice: an operator for joining Message Sequence Charts, in: D. Hogrefe, S. Leue (Eds.), Formal Description Techniques VII, IFIP Transactions C, Proceedings 7th International Conference on Formal Description Techniques, Chapman-Hall, 1994, pp. 340\u2013354.","DOI":"10.1007\/978-0-387-34878-0_27"},{"key":"10.1016\/S1389-1286(99)00060-2_BIB3","unstructured":"J.C.M. Baeten, C. Verhoef, Concrete process algebra, in: S. Abramsky, Dov M. Gabbay, T.S.E. Maibaum (Eds.), Semantic Modelling, Handbook of Logic in Computer Science, vol. 4, Oxford University Press, 1995, pp. 149\u2013268."},{"key":"10.1016\/S1389-1286(99)00060-2_BIB4","doi-asserted-by":"crossref","unstructured":"J.C.M. Baeten, W.P. Weijland, Process Algebra, Cambridge Tracts in Theoretical Computer Science, vol. 18, Cambridge University Press, 1990.","DOI":"10.1017\/CBO9780511624193"},{"key":"10.1016\/S1389-1286(99)00060-2_BIB5","doi-asserted-by":"crossref","unstructured":"J.A. Bergstra, I. Bethke, A. Ponse, Process algebra with iteration and nesting, The Computer Journal 37 (4) (1994) 243\u2013258.","DOI":"10.1093\/comjnl\/37.4.243"},{"key":"10.1016\/S1389-1286(99)00060-2_BIB6","doi-asserted-by":"crossref","unstructured":"J.A. Bergstra, J.W. Klop, Process algebra for synchronous communication, Information and Control 60 (1\/3) (1984) 109\u2013137.","DOI":"10.1016\/S0019-9958(84)80025-X"},{"key":"10.1016\/S1389-1286(99)00060-2_BIB7","doi-asserted-by":"crossref","unstructured":"T. Bolognesi, E. Brinksma, Introduction to the ISO specification language LOTOS, Computer Networks and ISDN Systems 14 (1) (1988) 25\u201359.","DOI":"10.1016\/0169-7552(87)90085-7"},{"key":"10.1016\/S1389-1286(99)00060-2_BIB8","doi-asserted-by":"crossref","unstructured":"J. Engelfriet, Determinacy \u2192 (observation equivalence = trace equivalence), Theoretical Computer Science 36 (1) (1985) 21\u201325.","DOI":"10.1016\/0304-3975(85)90028-3"},{"key":"10.1016\/S1389-1286(99)00060-2_BIB9","unstructured":"J. Grabowski, P. Graubmann, E. Rudolph, Towards a Petri net based semantics definition for Message Sequence Charts, in: O. F\u00e6rgemand, A. Sarma (Eds.), SDL'93 - Using Objects, Proceedings of the Sixth SDL Forum, Darmstadt, 1993, Amsterdam, North-Holland, pp. 179\u2013190."},{"key":"10.1016\/S1389-1286(99)00060-2_BIB10","unstructured":"\u00d8. Haugen. MSC structural concepts, Technical Report TD 9006, ITU-T Experts Meeting SG 10, Turin, 1994."},{"key":"10.1016\/S1389-1286(99)00060-2_BIB11","doi-asserted-by":"crossref","unstructured":"\u00d8. Haugen, Y. Lahav. MSC\/SDL new features, Tutorials of the Eighth SDL Forum, 1997.","DOI":"10.1016\/B978-044482816-3\/50012-5"},{"key":"10.1016\/S1389-1286(99)00060-2_BIB12","unstructured":"ITU-T, ITU-T Recommendation Z.100: Specification and Description Language (SDL), ITU-T, Geneva, 1992."},{"key":"10.1016\/S1389-1286(99)00060-2_BIB13","unstructured":"ITU-T, ITU-T Recommendation Z.100 Annex I: SDL Methodology Guidelines, ITU-T, Geneva, 1993."},{"key":"10.1016\/S1389-1286(99)00060-2_BIB14","unstructured":"ITU-T, ITU-T Recommendation Z.120: Message Sequence Chart (MSC), ITU-T, Geneva, September 1993."},{"key":"10.1016\/S1389-1286(99)00060-2_BIB15","unstructured":"ITU-T, ITU-T Recommendation Z.120 Annex B: Algebraic semantics of Message Sequence Charts, ITU-T, Geneva, April 1995."},{"key":"10.1016\/S1389-1286(99)00060-2_BIB16","unstructured":"ITU-T, ITU-T Recommendation Z.120: Message Sequence Chart (MSC96), ITU-T, Geneva, 1996."},{"key":"10.1016\/S1389-1286(99)00060-2_BIB17","doi-asserted-by":"crossref","unstructured":"P.B. Ladkin, S. Leue, Interpreting message flow graphs, Formal Aspects of Computing 7 (5) (1995) 473\u2013509.","DOI":"10.1007\/BF01211629"},{"key":"10.1016\/S1389-1286(99)00060-2_BIB18","doi-asserted-by":"crossref","unstructured":"S. Loidl, E. Rudolph, U. Rinkel. MSC'96 and beyond - a critical look, in: A. Cavalli, A. Sarma (Eds.), SDL'97: Time for Testing - SDL, MSC and Trends, Proceedings of the Eighth SDL Forum, Evry, France, 1997, Elsevier Science Publishers, pp. 213\u2013227.","DOI":"10.1016\/B978-044482816-3\/50015-0"},{"key":"10.1016\/S1389-1286(99)00060-2_BIB19","unstructured":"J. de Man, Towards a formal semantics of Message Sequence Charts, in: O. F\u00e6rgemand, A. Sarma (Eds.), SDL'93: Using Objects, Proceedings of the Sixth SDL Forum, Darmstadt, 1993. Amsterdam, North-Holland, pp. 157\u2013165."},{"key":"10.1016\/S1389-1286(99)00060-2_BIB20","doi-asserted-by":"crossref","unstructured":"S. Mauw, The formalization of Message Sequence Charts, Computer Networks and ISDN Systems 28 (12) (1996) 1643\u20131657, Special issue on SDL and MSC, guest editor \u00d8. Haugen.","DOI":"10.1016\/0169-7552(95)00123-9"},{"key":"10.1016\/S1389-1286(99)00060-2_BIB21","doi-asserted-by":"crossref","unstructured":"S. Mauw, E.A. van der Meulen, Generating tools for Message Sequence Charts, in: R. Br\u00e6k, A. Sarma (Eds.), SDL'95 with MSC in CASE, Proceedings of the Seventh SDL Forum, Oslo, 1995. Amsterdam, North-Holland, pp. 51\u201362.","DOI":"10.1016\/B978-0-444-82269-7.50009-5"},{"key":"10.1016\/S1389-1286(99)00060-2_BIB22","doi-asserted-by":"crossref","unstructured":"S. Mauw, M.A. Reniers, An algebraic semantics of Basic Message Sequence Charts, The Computer Journal 37 (4) (1994) 269\u2013277.","DOI":"10.1093\/comjnl\/37.4.269"},{"key":"10.1016\/S1389-1286(99)00060-2_BIB23","unstructured":"S. Mauw, M.A. Reniers, An algebraic semantics of Message Sequence Charts, Technical Report CSN 94\/23, Eindhoven University of Technology, Department of Computing Science, Eindhoven, 1994."},{"key":"10.1016\/S1389-1286(99)00060-2_BIB24","doi-asserted-by":"crossref","unstructured":"S. Mauw, M.A. Reniers, High-Level Message Sequence Charts, in: A. Cavalli, A. Sarma (Eds.), SDL'97: Time for Testing - SDL, MSC and Trends, Proceedings of the Eighth SDL Forum, Evry, France, 1997, Elsevier Science Publishers, pp. 291\u2013306.","DOI":"10.1016\/B978-044482816-3\/50020-4"},{"key":"10.1016\/S1389-1286(99)00060-2_BIB25","unstructured":"S. Mauw, M. van Wijk, T. Winter, A formal semantics of synchronous Interworkings, in: O. F\u00e6rgemand, A. Sarma (Eds.), SDL'93 - Using Objects, Proceedings of the Sixth SDL Forum, Darmstadt, 1993, Amsterdam, North-Holland, pp. 167\u2013178."},{"key":"10.1016\/S1389-1286(99)00060-2_BIB26","doi-asserted-by":"crossref","unstructured":"D.M.R. Park, Concurrency and automata on infinite sequences, in: P. Deussen (Ed.), Theoretical Computer Science, Lecture Notes in Computer Science, vol. 104 Springer-Verlag, 1981, pp. 167\u2013183; Proceedings of the Fifth GI-Conference, Karlsruhe, West Germany.","DOI":"10.1007\/BFb0017309"},{"key":"10.1016\/S1389-1286(99)00060-2_BIB27","doi-asserted-by":"crossref","unstructured":"A. Rensink, H. Wehrheim, Weak sequential composition in process algebras, in: B. Jonsson, J. Parrow (Eds.), CONCUR'94: Concurrency Theory, Lecture Notes in Computer Science, vol. 836, Uppsala, 1994, Springer, pp. 226\u2013241.","DOI":"10.1007\/978-3-540-48654-1_20"},{"key":"10.1016\/S1389-1286(99)00060-2_BIB28","doi-asserted-by":"crossref","unstructured":"E. Rudolph, J. Grabowski, P. Graubmann, Tutorial on Message Sequence Charts (MSC'96), Tutorials of the First joint International Conference on Formal Description Techniques for Distributed Systems and Communication Protocols, and Protocol Specification, Testing, and Verification (FORTE\/PSTV'96), 1996.","DOI":"10.1016\/0169-7552(95)00122-0"},{"key":"10.1016\/S1389-1286(99)00060-2_BIB29","doi-asserted-by":"crossref","unstructured":"J.L.M. Vrancken, The algebra of communicating processes with empty step, Theoretical Computer Science 177 (2) (1997) 287\u2013328.","DOI":"10.1016\/S0304-3975(96)00250-2"}],"container-title":["Computer Networks"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S1389128699000602?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S1389128699000602?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2020,2,5]],"date-time":"2020-02-05T06:07:22Z","timestamp":1580882842000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S1389128699000602"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1999,6]]},"references-count":29,"journal-issue":{"issue":"17","published-print":{"date-parts":[[1999,6]]}},"alternative-id":["S1389128699000602"],"URL":"https:\/\/doi.org\/10.1016\/s1389-1286(99)00060-2","relation":{},"ISSN":["1389-1286"],"issn-type":[{"value":"1389-1286","type":"print"}],"subject":[],"published":{"date-parts":[[1999,6]]}}}