{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,30]],"date-time":"2026-05-30T04:58:27Z","timestamp":1780117107308,"version":"3.54.0"},"publisher-location":"Berlin, Heidelberg","reference-count":10,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540643562","type":"print"},{"value":"9783540697534","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1998]]},"DOI":"10.1007\/bfb0054166","type":"book-chapter","created":{"date-parts":[[2006,7,27]],"date-time":"2006-07-27T01:43:43Z","timestamp":1153964623000},"page":"85-101","source":"Crossref","is-referenced-by-count":39,"title":["Practical model-checking using games"],"prefix":"10.1007","author":[{"given":"Perdita","family":"Stevens","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Colin","family":"Stirling","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2006,5,25]]},"reference":[{"key":"7_CR1","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1016\/0304-3975(94)90266-6","volume":"126","author":"H. Andersen","year":"1994","unstructured":"Andersen, H. (1994). Model checking and boolean graphs. Theoretical Comp. Science, 126, 3\u201330.","journal-title":"Theoretical Comp. Science"},{"key":"7_CR2","doi-asserted-by":"crossref","first-page":"142","DOI":"10.1007\/3-540-58179-0_50","volume":"818","author":"O. Bernholtz","year":"1994","unstructured":"Bernholtz, O., Vardi, M. and Wolper, P. (1994). An automata-theoretic approach to branching-time model checking. Lecture Notes in Computer Science, 818, 142\u2013155.","journal-title":"Lecture Notes in Computer Science"},{"key":"7_CR3","doi-asserted-by":"crossref","first-page":"385","DOI":"10.1007\/3-540-56922-7_32","volume":"697","author":"E. Emerson","year":"1993","unstructured":"Emerson, E., Jutla, C, and Sistla, A. (1993). On model checking for fragments of \u039c-calculus. Lecture Notes in Computer Science, 697, 385\u2013396.","journal-title":"Lecture Notes in Computer Science"},{"key":"7_CR4","doi-asserted-by":"crossref","first-page":"338","DOI":"10.1007\/3-540-58179-0_66","volume":"818","author":"D. Long","year":"1994","unstructured":"Long, D., Browne, A., Clarke, E., Jha, S., and Marrero, W. (1994) An improved algorithm for the evaluation of fixpoint expressions. Lecture Notes in Computer Science, 818, 338\u2013350.","journal-title":"Lecture Notes in Computer Science"},{"key":"7_CR5","unstructured":"Mader, A. (1996) Verification of Modal Properties Using Boolean Equation Systems. Doctoral dissertation, Institut f\u00fcr Informatik, Technische Universit\u00e4t M\u00fcnchen."},{"key":"7_CR6","unstructured":"Milner, R. (1989) Communication and Concurrency Prentice Hall"},{"key":"7_CR7","unstructured":"Moller, F. and Stevens, P. (1996). The Edinburgh Concurrency Workbench user manual. \n                  http:\/\/www.dcs.ed.ac.uk\/home\/cwb\n                  \n                ."},{"key":"7_CR8","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/3-540-60218-6_1","volume":"962","author":"C. Stirling","year":"1995","unstructured":"Stirling, C. (1995). Local model checking games. Lecture Notes in Computer Science, 962, 1\u201311.","journal-title":"Lecture Notes in Computer Science"},{"key":"7_CR9","doi-asserted-by":"crossref","first-page":"149","DOI":"10.1007\/3-540-60915-6_5","volume":"1043","author":"C. Stirling","year":"1996","unstructured":"Stirling, C. (1996). Modal and temporal logics for processes. Lecture Notes in Computer Science, 1043, 149\u2013237.","journal-title":"Lecture Notes in Computer Science"},{"key":"7_CR10","doi-asserted-by":"publisher","first-page":"161","DOI":"10.1016\/0304-3975(90)90110-4","volume":"89","author":"C. Stirling","year":"1991","unstructured":"Stirling, C. and Walker, D. (1991) Local model checking in the modal mu-calculus. Theoretical Computer Science, 89, 161\u2013177.","journal-title":"Theoretical Computer Science"}],"container-title":["Lecture Notes in Computer Science","Tools and Algorithms for the Construction and Analysis of Systems"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BFb0054166","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,2,11]],"date-time":"2019-02-11T10:47:44Z","timestamp":1549882064000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BFb0054166"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1998]]},"ISBN":["9783540643562","9783540697534"],"references-count":10,"URL":"https:\/\/doi.org\/10.1007\/bfb0054166","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[1998]]}}}