{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T10:12:01Z","timestamp":1743070321857,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":15,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540408284"},{"type":"electronic","value":"9783540452362"}],"license":[{"start":{"date-parts":[[2003,1,1]],"date-time":"2003-01-01T00:00:00Z","timestamp":1041379200000},"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":[[2003]]},"DOI":"10.1007\/978-3-540-45236-2_33","type":"book-chapter","created":{"date-parts":[[2010,6,25]],"date-time":"2010-06-25T20:08:38Z","timestamp":1277496518000},"page":"600-616","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":10,"title":["Watchdog Transformations for Property-Oriented Model-Checking"],"prefix":"10.1007","author":[{"given":"Michael","family":"Goldsmith","sequence":"first","affiliation":[]},{"given":"Nick","family":"Moffat","sequence":"additional","affiliation":[]},{"given":"Bill","family":"Roscoe","sequence":"additional","affiliation":[]},{"given":"Tim","family":"Whitworth","sequence":"additional","affiliation":[]},{"given":"Irfan","family":"Zakiuddin","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2003,9,25]]},"reference":[{"key":"33_CR1","volume-title":"The Theory and Practice of Concurrency","author":"A.W. Roscoe","year":"1998","unstructured":"Roscoe, A.W.: The Theory and Practice of Concurrency. Prentice-Hall, Englewood Cliffs (1998)"},{"key":"33_CR2","unstructured":"Zakiuddin, I., Moffat, N., Goldsmith, M., Whitworth, T.: Property Based Compression Strategies. In: Proceedings of Second Workshop on Automated Verification of Critical Systems (AVoCS 2002), April 15-16, University of Birmingham (2002)"},{"key":"33_CR3","unstructured":"de Roever, W.P., de Boer, F., Hannemann, U., Hooman, J., Lakhnech, Y., Poel, M., Zwiers, J.: Concurrency Verification: Introduction to Compositional and Noncompositional Proof Methods. Cambridge Tracts in Theoretical Computer Science\u00a054 (2001)"},{"key":"33_CR4","doi-asserted-by":"crossref","unstructured":"Clarke, E.M., Grumberg, O.: Model Checking and Abstraction. ACM Transactions on Programming Languages and Systems. ACM Press, New York, 1512\u20131542 (1992)","DOI":"10.1145\/186025.186051"},{"key":"33_CR5","doi-asserted-by":"crossref","unstructured":"Clarke, E., Filkorn, T., Jha, S.: Exploiting symmetry in temporal logic model checking. In: Proceedings of 5th International Conference on Computer Aided Verification (1993)","DOI":"10.1007\/3-540-56922-7_37"},{"key":"33_CR6","series-title":"Computer Hardware Description Languages and their Applications","volume-title":"Better Verification Through Symmetry","author":"C.N. Ip","year":"1996","unstructured":"Ip, C.N., Dill, D.L.: Better Verification Through Symmetry. Computer Hardware Description Languages and their Applications. Elsevier Science Publishers B.V, Amsterdam (1996)"},{"key":"33_CR7","doi-asserted-by":"crossref","unstructured":"Emerson, E.A., Sistla, A.P.: Symmetry and Model Checking. Formal Methods in System Design: An International Journal, 105\u2013131. Kluwer Academic Publishers (1994)","DOI":"10.1007\/BF00625970"},{"key":"33_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"156","DOI":"10.1007\/BFb0023729","volume-title":"2nd Workshop on Computer Aided Verification","author":"A. Valmari","year":"1987","unstructured":"Valmari, A.: A stubborn attack on state explosion. In: 2nd Workshop on Computer Aided Verification, New Brunswick, NJ. LNCS, vol.\u00a0531, pp. 156\u2013165. Springer, Heidelberg (1987)"},{"key":"33_CR9","doi-asserted-by":"publisher","first-page":"143","DOI":"10.1016\/0304-3975(94)90009-4","volume":"126","author":"D. Peled","year":"1994","unstructured":"Peled, D., Pnueli, A.: Proving partial order properties. Theoretical Computer Science\u00a0126, 143\u2013182 (1994)","journal-title":"Theoretical Computer Science"},{"key":"33_CR10","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-60761-7","volume-title":"Partial-order Methods for the Verification of Concurrent Systems","author":"P. Godefroid","year":"1996","unstructured":"Godefroid, P.: Partial-order Methods for the Verification of Concurrent Systems. Springer, Heidelberg (1996)"},{"key":"33_CR11","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4615-3190-6","volume-title":"Symbolic Model Checking","author":"K.L. McMillan","year":"1993","unstructured":"McMillan, K.L.: Symbolic Model Checking. Kluver Academic Press, London (1993)"},{"key":"33_CR12","unstructured":"Formal Systems (Europe) Ltd.: FDR User Manual, 1992-99"},{"key":"33_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-60630-0_7","volume-title":"Tools and Algorithms for the Construction and Analysis of Systems","author":"A.W. Roscoe","year":"1995","unstructured":"Roscoe, A.W., Goldsmith, M., Gardiner, P.H.B., Jackson, D., Scattergood, B., Hulance, J.: Hierarchical Compression for Model-Checking CSP, or How to Check 1020 Dining Philosophers for Deadlock. In: Brinksma, E., Steffen, B., Cleaveland, W.R., Larsen, K.G., Margaria, T. (eds.) TACAS 1995. LNCS, vol.\u00a01019. Springer, Heidelberg (1995)"},{"key":"33_CR14","unstructured":"Scattergood, J.B.: Tools for CSP and Timed CSP. Oxford University D.Phil. thesis (1998)"},{"key":"33_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"161","DOI":"10.1007\/3-540-45694-5_12","volume-title":"CONCUR 2002 - Concurrency Theory","author":"A. Valmari","year":"2002","unstructured":"Valmari, A., Kervinen, A.: Alphabet-Based Synchronisation is Exponentially Cheaper. In: Brim, L., Jan\u010dar, P., K\u0159et\u00ednsk\u00fd, M., Kucera, A. (eds.) CONCUR 2002. LNCS, vol.\u00a02421, p. 161. Springer, Heidelberg (2002)"}],"container-title":["Lecture Notes in Computer Science","FME 2003: Formal Methods"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-45236-2_33","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,1,23]],"date-time":"2020-01-23T13:09:40Z","timestamp":1579784980000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-45236-2_33"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003]]},"ISBN":["9783540408284","9783540452362"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-45236-2_33","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2003]]},"assertion":[{"value":"25 September 2003","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}