{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T16:30:05Z","timestamp":1725467405918},"publisher-location":"Berlin, Heidelberg","reference-count":15,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540648963"},{"type":"electronic","value":"9783540684558"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1998]]},"DOI":"10.1007\/bfb0055621","type":"book-chapter","created":{"date-parts":[[2006,7,27]],"date-time":"2006-07-27T07:31:00Z","timestamp":1153985460000},"page":"147-162","source":"Crossref","is-referenced-by-count":1,"title":["Abstract games for infinite state processes"],"prefix":"10.1007","author":[{"given":"Perdita","family":"Stevens","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2006,5,28]]},"reference":[{"issue":"2","key":"10_CR1","doi-asserted-by":"publisher","first-page":"183","DOI":"10.1016\/0304-3975(94)90010-8","volume":"126","author":"R. Alur","year":"1994","unstructured":"R. Alur and D.L. Dili, Theory of Timed Automata, Theoretical Computer Science 126(2) pp183\u2013235, 1994","journal-title":"Theoretical Computer Science"},{"key":"10_CR2","doi-asserted-by":"publisher","first-page":"157","DOI":"10.1016\/0304-3975(92)90183-G","volume":"96","author":"J. Bradfield","year":"1992","unstructured":"J. Bradfield and C. Stirling, Local model checking for infinite state spaces. Theoretical Computer Science, 96 pp 157\u2013174 (1992).","journal-title":"Theoretical Computer Science"},{"key":"10_CR3","unstructured":"K. Cerans, Decidability of bisimulation for parallel timer processes, CAV 92."},{"key":"10_CR4","unstructured":"D. Clark, L. Errington and C. Hankin, Static Analysis of Value-Passing Process Calculi, in Theory and Formal Methods 1994."},{"key":"10_CR5","first-page":"51","volume":"983","author":"R. Cleaveland","year":"1995","unstructured":"R. Cleaveland, Optimality in Abstractions of Model Checking, LNCS 983 pp51\u201363, 1995.","journal-title":"LNCS"},{"key":"10_CR6","doi-asserted-by":"crossref","unstructured":"R. Cleaveland and J. Reily. Testing-based abstractions for value-passing systems. Proceedings of CONCUR'94, LNCS 836, pp417\u2013432.","DOI":"10.1007\/BFb0015023"},{"issue":"4","key":"10_CR7","doi-asserted-by":"crossref","first-page":"511","DOI":"10.1093\/logcom\/2.4.511","volume":"2","author":"P. Cousot","year":"1992","unstructured":"P. Cousot and R. Cousot, Abstract Interpretation Frameworks, Logic and Computation 2(4) pp511\u2013547, 1992.","journal-title":"Logic and Computation"},{"key":"10_CR8","doi-asserted-by":"publisher","first-page":"35","DOI":"10.1006\/inco.1996.0072","volume":"129","author":"M. Dam","year":"1996","unstructured":"M. Dam, Model Checking Mobile Processes, Information and Computation 129, 35\u201351, 1996.","journal-title":"Information and Computation"},{"key":"10_CR9","doi-asserted-by":"publisher","first-page":"353","DOI":"10.1016\/0304-3975(94)00172-F","volume":"138","author":"M. Hennessy","year":"1995","unstructured":"M. Hennessy and H. Lin, Symbolic Bisimulations. Theoretical Computer Science, 138:353\u2013389, 1995.","journal-title":"Theoretical Computer Science"},{"issue":"2","key":"10_CR10","doi-asserted-by":"publisher","first-page":"272","DOI":"10.1006\/inco.1993.1069","volume":"107","author":"B. Jonsson","year":"1993","unstructured":"B. Jonsson and J. Parrow, Deciding bisimulation equivalences for a class of nonfinite-state programs. Information and Computation, 107(2) pp 272\u2013302, Dec 1993.","journal-title":"Information and Computation"},{"key":"10_CR11","doi-asserted-by":"crossref","unstructured":"H. Lin, Symbolic Transition Graph with Assignment. Proceedings of CONCUR'96, LNCS 1119, pp50\u201365.","DOI":"10.1007\/3-540-61604-7_47"},{"key":"10_CR12","unstructured":"R. Milner, Communication and Concurrency. Prentice Hall 1989."},{"key":"10_CR13","unstructured":"J. Rathke, Symbolic Techniques for Value-Passing Calculi. PhD. thesis, University of Sussex, 1997."},{"key":"10_CR14","doi-asserted-by":"crossref","unstructured":"P. Stevens and C. Stirling, Practical Model-Checking using Games. Proceedings of TACAS'98, LNCS 1384, pp 85\u2013101","DOI":"10.1007\/BFb0054166"},{"key":"10_CR15","first-page":"149","volume":"1043","author":"C. Stirling","year":"1996","unstructured":"C. Stirling, Modal and temporal logics for processes. LNCS 1043 pp149\u2013237. 1996.","journal-title":"LNCS"}],"container-title":["Lecture Notes in Computer Science","CONCUR'98 Concurrency Theory"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BFb0055621","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,4,20]],"date-time":"2019-04-20T08:29:02Z","timestamp":1555748942000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BFb0055621"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1998]]},"ISBN":["9783540648963","9783540684558"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/bfb0055621","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1998]]}}}