{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,6]],"date-time":"2025-11-06T19:55:45Z","timestamp":1762458945621},"publisher-location":"Berlin, Heidelberg","reference-count":11,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540610427"},{"type":"electronic","value":"9783540498742"}],"license":[{"start":{"date-parts":[[1996,1,1]],"date-time":"1996-01-01T00:00:00Z","timestamp":820454400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1996]]},"DOI":"10.1007\/3-540-61042-1_37","type":"book-chapter","created":{"date-parts":[[2012,2,26]],"date-time":"2012-02-26T16:12:01Z","timestamp":1330272721000},"page":"35-48","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":55,"title":["An analyzer for message sequence charts"],"prefix":"10.1007","author":[{"given":"Rajeev","family":"Alur","sequence":"first","affiliation":[]},{"given":"Gerard J.","family":"Holzmann","sequence":"additional","affiliation":[]},{"given":"Doron","family":"Peled","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2005,6,2]]},"reference":[{"issue":"1","key":"4_CR1","doi-asserted-by":"crossref","first-page":"142","DOI":"10.1006\/inco.1995.1059","volume":"118","author":"R. Alur","year":"1995","unstructured":"R. Alur, A. Itai, R.P. Kurshan, M. Yannakakis. Timing verification by successive approximation. Information and Computation\n                118(1), pp. 142\u2013157, 1995.","journal-title":"Information and Computation"},{"key":"4_CR2","first-page":"197","volume":"407","author":"D.L. Dill","year":"1989","unstructured":"D.L. Dill. Timing assumptions and verification of finite-state concurrent systems. In Automatic Verification Methods for Finite State Systems, LNCS 407, pp. 197\u2013212, 1989.","journal-title":"LNCS"},{"key":"4_CR3","first-page":"365","volume":"5","author":"R.W. Floyd","year":"1962","unstructured":"R.W. Floyd. Algorithm 97 (Shortest Path). Communications of the ACM\n                5 (1962), pp. 365.","journal-title":"Communications of the ACM"},{"key":"4_CR4","unstructured":"G.J. Holzmann. Design and Validation of Computer Protocols, Prentice Hall Software Series, 1991."},{"key":"4_CR5","unstructured":"ITU-T Recommendation Z.120, Message Sequence Chart (MSC), March 1993. (Includes [7] as Annex B.)"},{"key":"4_CR6","unstructured":"P.B. Ladkin, S. Leue. What do message sequence charts mean. In Formal Description Techniques, VI 1994 (FORTE'94), Elsevier, pp. 301\u2013315."},{"key":"4_CR7","doi-asserted-by":"crossref","unstructured":"S. Mauw, M.A. Reniers. An algebraic semantics of basic message sequence charts. The Computer Journal, 37(4) (1994).","DOI":"10.1093\/comjnl\/37.4.269"},{"key":"4_CR8","unstructured":"J. Ousterhout. Tcl and the Tk toolkit, Addison-Wesley, 1994."},{"key":"4_CR9","unstructured":"C.H. Papadimitriou, K. Steiglitz. Combinatorial Optimization-Algorithms and Complexity, Prentice-Hall, 1982."},{"key":"4_CR10","unstructured":"T.H. Cormen, C.E. Leiserson, R.L. Rivest, Introduction to Algorithms, MIT press, 1990."},{"key":"4_CR11","doi-asserted-by":"crossref","first-page":"11","DOI":"10.1145\/321105.321107","volume":"9","author":"S. Warshall","year":"1962","unstructured":"S. Warshall. A theorem on boolean matrices. Journal of the ACM, 9 (1962), pp. 11\u201312.","journal-title":"Journal of the ACM"}],"container-title":["Lecture Notes in Computer Science","Tools and Algorithms for the Construction and Analysis of Systems"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-61042-1_37","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,19]],"date-time":"2019-05-19T08:21:06Z","timestamp":1558254066000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-61042-1_37"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1996]]},"ISBN":["9783540610427","9783540498742"],"references-count":11,"URL":"https:\/\/doi.org\/10.1007\/3-540-61042-1_37","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1996]]},"assertion":[{"value":"2 June 2005","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}