{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,28]],"date-time":"2025-03-28T03:36:42Z","timestamp":1743133002425,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":12,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642198281"},{"type":"electronic","value":"9783642198298"}],"license":[{"start":{"date-parts":[[2011,1,1]],"date-time":"2011-01-01T00:00:00Z","timestamp":1293840000000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2011]]},"DOI":"10.1007\/978-3-642-19829-8_9","type":"book-chapter","created":{"date-parts":[[2011,3,16]],"date-time":"2011-03-16T10:20:41Z","timestamp":1300270841000},"page":"128-143","source":"Crossref","is-referenced-by-count":0,"title":["Simulating Truly Concurrent CSP"],"prefix":"10.1007","author":[{"given":"Moritz","family":"Kleine","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"J. W.","family":"Sanders","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"9_CR1","doi-asserted-by":"publisher","first-page":"423","DOI":"10.1007\/978-0-387-35261-9_29","volume-title":"FMOODS 1997: International Workshop on Formal Methods for Open Object-Based Distributed Systems","author":"C. Fischer","year":"1997","unstructured":"Fischer, C.: CSP-OZ: A combination of Object-Z and CSP. In: FMOODS 1997: International Workshop on Formal Methods for Open Object-Based Distributed Systems, pp. 423\u2013438. Chapman and Hall, Boca Raton (1997)"},{"key":"9_CR2","first-page":"237","volume-title":"MEMOCODE 2003: International Conference on Formal Methods and Models for Co-Design","author":"W.B. Gardner","year":"2003","unstructured":"Gardner, W.B.: Bridging CSP and C++ with Selective Formalism and Executable Specifications. In: MEMOCODE 2003: International Conference on Formal Methods and Models for Co-Design, pp. 237\u2013245. IEEE Computer Society, Los Alamitos (2003)"},{"key":"9_CR3","unstructured":"Goldsmith, M., Roscoe, B., Armstrong, P.: Failures-Divergence Refinement - FDR2 User Manual (2005), \n                  \n                    http:\/\/www.fsel.com\/fdr2_manual.html"},{"key":"9_CR4","volume-title":"Communicating Sequential Processes","author":"C.A.R. Hoare","year":"1985","unstructured":"Hoare, C.A.R.: Communicating Sequential Processes. Prentice Hall International, Englewood Cliffs (1985)"},{"key":"9_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"108","DOI":"10.1007\/978-3-540-31980-1_8","volume-title":"Tools and Algorithms for the Construction and Analysis of Systems","author":"Y. Isobe","year":"2005","unstructured":"Isobe, Y., Roggenbach, M.: A Generic Theorem Prover of CSP Refinement. In: Halbwachs, N., Zuck, L.D. (eds.) TACAS 2005. LNCS, vol.\u00a03440, pp. 108\u2013123. Springer, Heidelberg (2005)"},{"key":"9_CR6","unstructured":"Kleine, M., Sanders, J.W.: Simulating truly concurrent CSP. Technical Report 434, UNU-IIST, P.O. Box 3058, Macau (June 2010)"},{"key":"9_CR7","series-title":"Lecture Notes in Computer Science","first-page":"220","volume-title":"CONCUR \u201995 Concurrency Theory","author":"M. Kwiatkowska","year":"1995","unstructured":"Kwiatkowska, M., Phillips, I.: Possible and Guaranteed Concurrency in CSP. In: Lee, I., Smolka, S.A. (eds.) CONCUR 1995. LNCS, vol.\u00a0962, pp. 220\u2013235. Springer, Heidelberg (1995)"},{"key":"9_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"278","DOI":"10.1007\/978-3-540-88194-0_18","volume-title":"Formal Methods and Software Engineering","author":"M. Leuschel","year":"2008","unstructured":"Leuschel, M., Fontaine, M.: Probing the Depths of CSP-M: A new FDR-compliant Validation Tool. In: Liu, S., Araki, K. (eds.) ICFEM 2008. LNCS, vol.\u00a05256, pp. 278\u2013297. Springer, Heidelberg (2008)"},{"key":"9_CR9","volume-title":"The Theory and Practice of Concurrency","author":"A.W. Roscoe","year":"2005","unstructured":"Roscoe, A.W.: The Theory and Practice of Concurrency. Prentice-Hall, Englewood Cliffs (2005)"},{"key":"9_CR10","unstructured":"Scattergood, B.: The Semantics and Implementation of Machine-readable CSP. PhD thesis, University of Oxford (1998)"},{"key":"9_CR11","series-title":"Lecture Notes in Computer Science","first-page":"307","volume-title":"FM 2008: Formal Methods","author":"J. Sun","year":"2008","unstructured":"Sun, J., Liu, Y., Dong, J.S.: Model Checking CSP Revisited: Introducing a Process Analysis Toolkit. In: Cuellar, J., Sere, K. (eds.) FM 2008. LNCS, vol.\u00a05014, pp. 307\u2013322. Springer, Heidelberg (2008)"},{"issue":"2","key":"9_CR12","doi-asserted-by":"publisher","first-page":"125","DOI":"10.1007\/BF00265151","volume":"27","author":"D. Taubner","year":"1989","unstructured":"Taubner, D., Vogler, W.: Step failures semantics and a complete proof system. Acta Inf.\u00a027(2), 125\u2013156 (1989)","journal-title":"Acta Inf."}],"container-title":["Lecture Notes in Computer Science","Formal Methods: Foundations and Applications"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-19829-8_9","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,21]],"date-time":"2019-05-21T07:00:41Z","timestamp":1558422041000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-19829-8_9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011]]},"ISBN":["9783642198281","9783642198298"],"references-count":12,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-19829-8_9","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2011]]}}}