{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T22:59:13Z","timestamp":1725663553578},"publisher-location":"Berlin, Heidelberg","reference-count":12,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540521488"},{"type":"electronic","value":"9783540469056"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1990]]},"DOI":"10.1007\/3-540-52148-8_15","type":"book-chapter","created":{"date-parts":[[2012,2,25]],"date-time":"2012-02-25T21:22:40Z","timestamp":1330204960000},"page":"179-188","source":"Crossref","is-referenced-by-count":7,"title":["Implementing a model checking algorithm by adapting existing automated tools"],"prefix":"10.1007","author":[{"given":"Bengt","family":"Jonsson","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ahmed Hussain","family":"Khan","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Joachim","family":"Parrow","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2005,6,1]]},"reference":[{"issue":"5","key":"15_CR1","doi-asserted-by":"crossref","first-page":"260","DOI":"10.1145\/362946.362970","volume":"2","author":"K. Bartlett","year":"1969","unstructured":"K. Bartlett, R. Scantlebury, and P. Wilkinson. A note on reliable full-duplex transmissions over half duplex lines. Communications of the ACM, 2(5):260\u2013261, 1969.","journal-title":"Communications of the ACM"},{"issue":"2","key":"15_CR2","doi-asserted-by":"crossref","first-page":"244","DOI":"10.1145\/5397.5399","volume":"8","author":"E. M. Clarke","year":"1986","unstructured":"E. M. Clarke, E. A. Emerson, and A. P. Sistla. Automatic verification of finite-state concurrent systems using temporal logics specifications. ACM TOPLAS, 8(2):244\u2013263, April 1986.","journal-title":"ACM TOPLAS"},{"unstructured":"R. Cleaveland, J. G. Parrow, and B. Steffen. The concurrency workbench: Operating instructions. University of Edinburgh, Laboratory for Foundations of Computer Science, Technical Note 10, September 1988.","key":"15_CR3"},{"unstructured":"E.A. Emerson and C.-L. Lei. Efficient model checking in fragments of the propositional mu-calculus. In Proc. Symp. on Logics in Computer Science, pages 267\u2013278, 1986.","key":"15_CR4"},{"issue":"1","key":"15_CR5","doi-asserted-by":"crossref","first-page":"137","DOI":"10.1145\/2455.2460","volume":"32","author":"M. Hennessy","year":"1985","unstructured":"Matthew Hennessy and Robin Milner. Algebraic laws for nondeterminism and concurrency. J. ACM, 32(1):137\u2013161, 1985.","journal-title":"J. ACM"},{"doi-asserted-by":"crossref","unstructured":"K. G. Larsen. Proof systems for Hennessy-Milner logic with recursion. In Proc. CAAP 1988, volume 299 of Lecture Notes of Computer Science. Springer Verlag, 1988.","key":"15_CR6","DOI":"10.1007\/BFb0026106"},{"doi-asserted-by":"crossref","unstructured":"O. Lichtenstein and A. Pnueli. Checking that finite state concurrent programs satisfy their linear specification. In Proc. 12th ACM Symp. on Principles of Programming Languages, pages 97\u2013107, 1985.","key":"15_CR7","DOI":"10.1145\/318593.318622"},{"doi-asserted-by":"crossref","unstructured":"R. Milner. A Calculus of Communicating Systems, volume 92 of Lecture Notes of Computer Science. Springer Verlag, 1980.","key":"15_CR8","DOI":"10.1007\/3-540-10235-3"},{"key":"15_CR9","doi-asserted-by":"crossref","first-page":"45","DOI":"10.1016\/0304-3975(81)90110-9","volume":"13","author":"A. Pnueli","year":"1982","unstructured":"A. Pnueli. The temporal semantics of concurrent programs. Theoretical Computer Science, 13:45\u201360, 1982.","journal-title":"Theoretical Computer Science"},{"unstructured":"J. Richier, C. Rodriguez, J. Sifakis, and J. Voiron. Verification in XESAR of the sliding window protocol. In Proceedings of the 7th IFIP Workshop on Protocol Specification, Testing and Verification. North-Holland, 1987.","key":"15_CR10"},{"doi-asserted-by":"crossref","unstructured":"C. Stirling and D. J. Walker. Local model checking in the modal \u03bc-calculus. In Diaz and Orejas, editors, TAPSOFT '89, volume 351 of Lecture Notes of Computer Science, pages 369\u2013383. Springer Verlag, 1989.","key":"15_CR11","DOI":"10.1007\/3-540-50939-9_144"},{"unstructured":"M. Y. Vardi and P. Wolper. An automata-theoretic approach to automatic program verification. In Symp. on Logic in Computer Science, pages 332\u2013344, June 1986.","key":"15_CR12"}],"container-title":["Lecture Notes in Computer Science","Automatic Verification Methods for Finite State Systems"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-52148-8_15.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,17]],"date-time":"2020-11-17T21:23:22Z","timestamp":1605648202000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-52148-8_15"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1990]]},"ISBN":["9783540521488","9783540469056"],"references-count":12,"URL":"https:\/\/doi.org\/10.1007\/3-540-52148-8_15","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1990]]}}}