{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,19]],"date-time":"2025-03-19T13:19:16Z","timestamp":1742390356457},"publisher-location":"Berlin, Heidelberg","reference-count":12,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540627814"},{"type":"electronic","value":"9783540685173"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1997]]},"DOI":"10.1007\/bfb0030632","type":"book-chapter","created":{"date-parts":[[2005,12,1]],"date-time":"2005-12-01T01:10:41Z","timestamp":1133399441000},"page":"652-666","source":"Crossref","is-referenced-by-count":9,"title":["Verification of message sequence charts via template matching"],"prefix":"10.1007","author":[{"given":"Vladimir","family":"Levin","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Doron","family":"Peled","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2005,6,20]]},"reference":[{"issue":"No.2","key":"51_CR1","first-page":"70","volume":"17","author":"R. Alur","year":"1996","unstructured":"R. Alur, G.J. Holzmann, D. Peled, An Analyzer for Message Sequence Charts, Software Concepts and Tools, Vol. 17, No. 2, 1996, pp 70\u201377.","journal-title":"Software Concepts and Tools"},{"key":"51_CR2","doi-asserted-by":"publisher","first-page":"87","DOI":"10.1016\/0304-3975(87)90090-9","volume":"55","author":"E. Best","year":"1987","unstructured":"E. Best, R. Devillers, Sequential and concurrent behaviour in Petri Net theory, Theoretical Computer Science 55 (1987), 87\u2013136.","journal-title":"Theoretical Computer Science"},{"key":"51_CR3","doi-asserted-by":"crossref","first-page":"155","DOI":"10.1016\/0167-6423(83)90013-8","volume":"2","author":"T. Elrad","year":"1982","unstructured":"Tz. Elrad, N. Francez, Decomposition of distributed programs into communication closed layers, Science of Computer Programming 2 (1982), 155\u2013173.","journal-title":"Science of Computer Programming"},{"issue":"No.2","key":"51_CR4","first-page":"63","volume":"17","author":"G.J. Holzmann","year":"1996","unstructured":"G.J. Holzmann Early Fault Detection Tools, Software Concepts and Tools, Vol. 17, No. 2, 1996, 63\u201369.","journal-title":"Software Concepts and Tools"},{"key":"51_CR5","unstructured":"ITU-T Recommendation Z.120, Message Sequence Chart (MSC), March 1993."},{"key":"51_CR6","doi-asserted-by":"crossref","unstructured":"W. Janssen, J. Zwiers, Protocol design by layered decomposition, a compositional approach, Proceedings of formal techniques in real-time and fault-tolerance systems 1992, LNCS 571, Springer, 307\u2013326.","DOI":"10.1007\/3-540-55092-5_17"},{"key":"51_CR7","doi-asserted-by":"crossref","unstructured":"R.P. Kurshan, Computer-Aided Verification, Princeton University Press, 1994.","DOI":"10.1007\/978-1-4615-3556-0"},{"key":"51_CR8","doi-asserted-by":"crossref","unstructured":"S.C. Kleene, Representation of events in nerve nets and finite automata, Automata Studies, annals of math studies 34, Princeton University Press, 1956.","DOI":"10.1515\/9781400882618-002"},{"key":"51_CR9","first-page":"269","volume":"254","author":"A. Mazurkiewicz","year":"1987","unstructured":"A. Mazurkiewicz, Trace theory, Advanced course on Petri nets, Bad Honnef, Germany, 1987, LNCS 254, 269\u2013324.","journal-title":"LNCS"},{"key":"51_CR10","doi-asserted-by":"publisher","first-page":"85","DOI":"10.1016\/0304-3975(81)90112-2","volume":"13","author":"M. Nielsen","year":"1981","unstructured":"M. Nielsen, G. Plotkin, G. Winskel, Petri Nets, Event Structures and Domains, Part I, Theoretical Computer Science 13(1981), 85\u2013108.","journal-title":"Theoretical Computer Science"},{"key":"51_CR11","doi-asserted-by":"publisher","first-page":"33","DOI":"10.1007\/BF01379149","volume":"15","author":"V. Pratt","year":"1986","unstructured":"V. Pratt, Modeling concurrency with partial orders, International Journal of Parallel Programming 15 (1986), 33\u201371.","journal-title":"International Journal of Parallel Programming"},{"key":"51_CR12","doi-asserted-by":"crossref","first-page":"177","DOI":"10.1016\/S0022-0000(70)80006-X","volume":"4","author":"W. J. Savitch","year":"1970","unstructured":"W. J. Savitch. Relationship between nondeterministic and deterministic tape complexities. J. on Computer and System Sciences, 4 (1970), 177\u2013192.","journal-title":"J. on Computer and System Sciences"}],"container-title":["Lecture Notes in Computer Science","TAPSOFT '97: Theory and Practice of Software Development"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BFb0030632","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,4,11]],"date-time":"2020-04-11T04:19:55Z","timestamp":1586578795000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BFb0030632"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1997]]},"ISBN":["9783540627814","9783540685173"],"references-count":12,"URL":"https:\/\/doi.org\/10.1007\/bfb0030632","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1997]]}}}