{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,5,4]],"date-time":"2025-05-04T16:10:08Z","timestamp":1746375008608,"version":"3.40.4"},"publisher-location":"Cham","reference-count":25,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319108810"},{"type":"electronic","value":"9783319108827"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2014]]},"DOI":"10.1007\/978-3-319-10882-7_18","type":"book-chapter","created":{"date-parts":[[2014,9,11]],"date-time":"2014-09-11T06:54:19Z","timestamp":1410418459000},"page":"295-313","source":"Crossref","is-referenced-by-count":0,"title":["Symbolic Analysis Tools for CSP"],"prefix":"10.1007","author":[{"given":"Liyi","family":"Li","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Elsa","family":"Gunter","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"William","family":"Mansky","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"issue":"3","key":"18_CR1","doi-asserted-by":"publisher","first-page":"560","DOI":"10.1145\/828.833","volume":"31","author":"S.D. Brookes","year":"1984","unstructured":"Brookes, S.D., Hoare, C.A.R., Roscoe, A.W.: A theory of communicating sequential processes. J. ACM\u00a031(3), 560\u2013599 (1984)","journal-title":"J. ACM"},{"key":"18_CR2","unstructured":"Paulson, L.C.: Isabelle: The next 700 theorem provers. In: Odifreddi, P. (ed.) Logic and Computer Science, pp. 361\u2013386. Academic Press (1990)"},{"key":"18_CR3","doi-asserted-by":"crossref","unstructured":"Clavel, M., Dur\u00e1n, F., Eker, S., Lincoln, P., Mart\u00ed-Oliet, N., Meseguer, J., Quesada, J.F.: Maude: Specification and programming in rewriting logic (2001)","DOI":"10.1016\/S0304-3975(01)00359-0"},{"key":"18_CR4","doi-asserted-by":"crossref","unstructured":"Gunter, E.L., Yasmeen, A., Gunter, C.A., Nguyen, A.: Specifying and analyzing workflows for automated identification and data capture. In: HICSS, pp. 1\u201311. IEEE Computer Society (2009)","DOI":"10.1109\/HICSS.2009.402"},{"key":"18_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"51","DOI":"10.1007\/978-3-540-77351-1_5","volume-title":"Software Composition","author":"P.Y.H. Wong","year":"2007","unstructured":"Wong, P.Y.H., Gibbons, J.: A process-algebraic approach to workflow specification and refinement. In: Lumpe, M., Vanderperren, W. (eds.) SC 2007. LNCS, vol.\u00a04829, pp. 51\u201365. Springer, Heidelberg (2007)"},{"key":"18_CR6","doi-asserted-by":"crossref","unstructured":"Wright, P., Fields, B., Harrison, M.: Deriving human-error tolerance requirements from tasks. In: Proc. of ICRE 1994 IEEE Intl. Conf. on Requirements Engineering, pp. 135\u2013142. IEEE (1994)","DOI":"10.1109\/ICRE.1994.292393"},{"key":"18_CR7","unstructured":"Ltd., F.S.E.: Failures-divergence refinement. FDR2 user manual. In: FDR2 User Manual (2010)"},{"key":"18_CR8","unstructured":"Scattergood, J.: The Semantics and Implementation of Machine-Readable CSP. D.phil., Oxford University Computing Laboratory (1998)"},{"key":"18_CR9","unstructured":"Li, L., Gunter, E.L., Mansky, W.: Symbolic semantics for csp. Technical report, Department of Computer Science, University of Illinois at Urbana-Champaign (2013)"},{"key":"18_CR10","unstructured":"Brookes, S.D., Roscoe, A.W., Walker, D.J.: An operational semantics for CSP. Technical report, Oxford University Computing Laboratory (1986)"},{"issue":"10","key":"18_CR11","doi-asserted-by":"publisher","first-page":"576","DOI":"10.1145\/363235.363259","volume":"12","author":"C.A.R. Hoare","year":"1969","unstructured":"Hoare, C.A.R.: An axiomatic basis for computer programming. Commun. ACM\u00a012(10), 576\u2013580 (1969)","journal-title":"Commun. ACM"},{"key":"18_CR12","volume-title":"The Theory and Practice of Concurrency","author":"A.W. Roscoe","year":"1997","unstructured":"Roscoe, A.W.: The Theory and Practice of Concurrency. Prentice Hall PTR, Upper Saddle River (1997)"},{"key":"18_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"367","DOI":"10.1007\/BFb0015020","volume-title":"CONCUR \u201994: Concurrency Theory","author":"R.J.R. Back","year":"1994","unstructured":"Back, R.J.R., Wright, J.V.: Trace refinement of action systems. In: Jonsson, B., Parrow, J. (eds.) CONCUR 1994. LNCS, vol.\u00a0836, pp. 367\u2013384. Springer, Heidelberg (1994)"},{"key":"18_CR14","unstructured":"Groote, J.F.: Binary decision diagrams for first order predicate logic"},{"key":"18_CR15","unstructured":"Ltd, F.S.E.: Process behaviour explorer. ProBE user manual. In: ProBE User Manual (2003)"},{"key":"18_CR16","series-title":"CCIS","first-page":"307","volume-title":"ISoLA 2008, Springer","author":"J. Sun","year":"2008","unstructured":"Sun, J., Liu, Y., Dong, J.S.: Model checking csp revisited: Introducing a process analysis toolkit. In: Margaria, T., Steffen, B. (eds.) ISoLA 2008, Springer. CCIS, vol.\u00a017, pp. 307\u2013322. Springer, Heidelberg (2008)"},{"key":"18_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"158","DOI":"10.1007\/11817949_11","volume-title":"CONCUR 2006 \u2013 Concurrency Theory","author":"Y. Isobe","year":"2006","unstructured":"Isobe, Y., Roggenbach, M.: A complete axiomatic semantics for the CSP stable-failures model. In: Baier, C., Hermanns, H. (eds.) CONCUR 2006. LNCS, vol.\u00a04137, pp. 158\u2013172. Springer, Heidelberg (2006)"},{"key":"18_CR18","unstructured":"Brooke, P.J., Paige, R.F.: Lazy exploration and checking of CSP models with CSPsim. In: McEwan, A.A., Schneider, S.A., Ifill, W., Welch, P.H. (eds.) CPA. Concurrent Systems Engineering Series, vol.\u00a065, pp. 33\u201349. IOS Press (2007)"},{"key":"18_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"187","DOI":"10.1007\/978-3-642-54862-8_13","volume-title":"Tools and Algorithms for the Construction and Analysis of Systems","author":"T. Gibson-Robinson","year":"2014","unstructured":"Gibson-Robinson, T., Armstrong, P., Boulgakov, A., Roscoe, A.W.: Fdr3 - a modern refinement checker for csp. In: \u00c1brah\u00e1m, E., Havelund, K. (eds.) TACAS 2014 (ETAPS). LNCS, vol.\u00a08413, pp. 187\u2013201. Springer, Heidelberg (2014)"},{"issue":"2","key":"18_CR20","doi-asserted-by":"publisher","first-page":"353","DOI":"10.1016\/0304-3975(94)00172-F","volume":"138","author":"M. Hennessy","year":"1995","unstructured":"Hennessy, M., Lin, H.: Symbolic bisimulations. Theor. Comput. Sci.\u00a0138(2), 353\u2013389 (1995)","journal-title":"Theor. Comput. Sci."},{"key":"18_CR21","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"127","DOI":"10.1007\/3-540-57208-2_10","volume-title":"CONCUR\u201993","author":"D. Sangiorgi","year":"1993","unstructured":"Sangiorgi, D.: A theory of bisimulation for the pi-calculus. In: Best, E. (ed.) CONCUR 1993. LNCS, vol.\u00a0715, pp. 127\u2013142. Springer, Heidelberg (1993)"},{"key":"18_CR22","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"395","DOI":"10.1007\/978-3-540-78499-9_28","volume-title":"Foundations of Software Science and Computational Structures","author":"F. Bonchi","year":"2008","unstructured":"Bonchi, F., Montanari, U.: Symbolic semantics revisited. In: Amadio, R.M. (ed.) FOSSACS 2008. LNCS, vol.\u00a04962, pp. 395\u2013412. Springer, Heidelberg (2008)"},{"key":"18_CR23","first-page":"184","volume-title":"Proc. Formal Techniques for Networked and Distributed Systems","author":"M. Calder","year":"2001","unstructured":"Calder, M., Shankland, C.: A symbolic semantics and bisimulation for full lotos. In: Proc. Formal Techniques for Networked and Distributed Systems, pp. 184\u2013200. Kluwer Academic Publishers, FORTE xXIV (2001)"},{"key":"18_CR24","doi-asserted-by":"publisher","first-page":"135","DOI":"10.1016\/j.entcs.2009.06.008","volume":"241","author":"R. Pugliese","year":"2009","unstructured":"Pugliese, R., Tiezzi, F., Yoshida, N.: A symbolic semantics for a calculus for service-oriented computing. Electron. Notes Theor. Comput. Sci.\u00a0241, 135\u2013164 (2009)","journal-title":"Electron. Notes Theor. Comput. Sci."},{"key":"18_CR25","unstructured":"Groote, J.F., Mathijssen, A., Reniers, M., Usenko, Y., Weerdenburg, M.V.: The formal specification language mcrl2. In: Proceedings of the Dagstuhl Seminar. MIT Press (2007)"}],"container-title":["Lecture Notes in Computer Science","Theoretical Aspects of Computing \u2013 ICTAC 2014"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-10882-7_18","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,5,4]],"date-time":"2025-05-04T15:44:36Z","timestamp":1746373476000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-10882-7_18"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014]]},"ISBN":["9783319108810","9783319108827"],"references-count":25,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-10882-7_18","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2014]]}}}