{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,25]],"date-time":"2025-03-25T23:01:01Z","timestamp":1742943661801,"version":"3.40.3"},"publisher-location":"Cham","reference-count":19,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319489889"},{"type":"electronic","value":"9783319489896"}],"license":[{"start":{"date-parts":[[2016,1,1]],"date-time":"2016-01-01T00:00:00Z","timestamp":1451606400000},"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":[[2016]]},"DOI":"10.1007\/978-3-319-48989-6_3","type":"book-chapter","created":{"date-parts":[[2016,11,7]],"date-time":"2016-11-07T01:31:19Z","timestamp":1478482279000},"page":"43-59","source":"Crossref","is-referenced-by-count":6,"title":["Tighter Reachability Criteria for Deadlock-Freedom Analysis"],"prefix":"10.1007","author":[{"given":"Pedro","family":"Antonino","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Thomas","family":"Gibson-Robinson","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"A. W.","family":"Roscoe","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2016,11,8]]},"reference":[{"key":"3_CR1","unstructured":"Antonino, P., Gibson-Robinson, T., Roscoe, A.W.: Experiment package (2016). http:\/\/www.cs.ox.ac.uk\/people\/pedro.antonino\/pkg.zip"},{"key":"3_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"345","DOI":"10.1007\/978-3-319-33693-0_22","volume-title":"Integrated Formal Methods","author":"P Antonino","year":"2016","unstructured":"Antonino, P., Gibson-Robinson, T., Roscoe, A.W.: Efficient Deadlock-Freedom Checking Using Local Analysis and SAT Solving. In: \u00c1brah\u00e1m, E., Huisman, M. (eds.) IFM 2016. LNCS, vol. 9681, pp. 345\u2013360. Springer, Heidelberg (2016). doi: 10.1007\/978-3-319-33693-0_22"},{"key":"3_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"31","DOI":"10.1007\/978-3-319-06200-6_3","volume-title":"NASA Formal Methods","author":"PRG Antonino","year":"2014","unstructured":"Antonino, P.R.G., Oliveira, M.M., Sampaio, A.C.A., Kristensen, K.E., Bryans, J.W.: Leadership election: an industrial SoS application of compositional deadlock verification. In: Badger, J.M., Rozier, K.Y. (eds.) NFM 2014. LNCS, vol. 8430, pp. 31\u201345. Springer, Heidelberg (2014). doi: 10.1007\/978-3-319-06200-6_3"},{"key":"3_CR4","unstructured":"Antonino, P., Roscoe, A.W., Gibson-Robinson, T.: Tighter reachability criteria for deadlock-freedom analysis. Technical report, University of Oxford (2016). http:\/\/www.cs.ox.ac.uk\/people\/pedro.antonino\/reach_techreport.pdf"},{"key":"3_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"62","DOI":"10.1007\/978-3-319-06410-9_5","volume-title":"FM 2014: Formal Methods","author":"P Antonino","year":"2014","unstructured":"Antonino, P., Sampaio, A., Woodcock, J.: A refinement based strategy for local deadlock analysis of networks of CSP processes. In: Jones, C., Pihlajasaari, P., Sun, J. (eds.) FM 2014. LNCS, vol. 8442, pp. 62\u201377. Springer, Heidelberg (2014). doi: 10.1007\/978-3-319-06410-9_5"},{"key":"3_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"161","DOI":"10.1007\/978-3-642-38592-6_12","volume-title":"Formal Techniques for Distributed Systems","author":"PC Attie","year":"2013","unstructured":"Attie, P.C., Bensalem, S., Bozga, M., Jaber, M., Sifakis, J., Zaraket, F.A.: An abstract framework for deadlock prevention in BIP. In: Beyer, D., Boreale, M. (eds.) FMOODS\/FORTE -2013. LNCS, vol. 7892, pp. 161\u2013177. Springer, Heidelberg (2013). doi: 10.1007\/978-3-642-38592-6_12"},{"key":"3_CR7","unstructured":"Audemard, G., Simon, L.: Predicting learnt clauses quality in modern SAT solvers. In: IJCAI 2009, San Francisco, CA, USA, pp. 399\u2013404 (2009)"},{"key":"3_CR8","unstructured":"Dathi, N.: Deadlock and deadlock freedom. Ph.D. thesis, University of Oxford (1989)"},{"key":"3_CR9","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\u2014a modern refinement checker for CSP. In: \u00c1brah\u00e1m, E., Havelund, K. (eds.) TACAS 2014. LNCS, vol. 8413, pp. 187\u2013201. Springer, Heidelberg (2014). doi: 10.1007\/978-3-642-54862-8_13"},{"key":"3_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"188","DOI":"10.1007\/978-3-319-17524-9_14","volume-title":"NASA Formal Methods","author":"T Gibson-Robinson","year":"2015","unstructured":"Gibson-Robinson, T., Hansen, H., Roscoe, A.W., Wang, X.: Practical partial order reduction for CSP. In: Havelund, K., Holzmann, G., Joshi, R. (eds.) NFM 2015. LNCS, vol. 9058, pp. 188\u2013203. Springer, Heidelberg (2015). doi: 10.1007\/978-3-319-17524-9_14"},{"key":"3_CR11","volume-title":"Communicating Sequential Processes","author":"CAR Hoare","year":"1985","unstructured":"Hoare, C.A.R.: Communicating Sequential Processes. Prentice-Hall, Upper Saddle River (1985)"},{"key":"3_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"64","DOI":"10.1007\/978-3-642-29320-7_5","volume-title":"Fundamentals of Software Engineering","author":"C Lambertz","year":"2012","unstructured":"Lambertz, C., Majster-Cederbaum, M.: Analyzing component-based systems on the basis of architectural constraints. In: Arbab, F., Sirjani, M. (eds.) FSEN 2011. LNCS, vol. 7141, pp. 64\u201379. Springer, Heidelberg (2012). doi: 10.1007\/978-3-642-29320-7_5"},{"key":"3_CR13","unstructured":"Martin, J.M.R.: The design and construction of deadlock-free concurrent systems. Ph.D. thesis, University of Buckingham (1996)"},{"key":"3_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"418","DOI":"10.1007\/3-540-63533-5_22","volume-title":"FME \u201997: Industrial Applications and Strengthened Foundations of Formal Methods","author":"JMR Martin","year":"1997","unstructured":"Martin, J.M.R., Jassim, S.A.: An efficient technique for deadlock analysis of large scale process networks. In: Fitzgerald, J., Jones, C.B., Lucas, P. (eds.) FME 1997. LNCS, vol. 1313, pp. 418\u2013441. Springer, Heidelberg (1997). doi: 10.1007\/3-540-63533-5_22"},{"key":"3_CR15","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-662-03811-6","volume-title":"Principles of Program Analysis","author":"F Nielson","year":"1999","unstructured":"Nielson, F., Nielson, H.R., Hankin, C.: Principles of Program Analysis. Springer, Secaucus (1999)"},{"key":"3_CR16","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/s00165-015-0345-z","volume":"28","author":"MVM Oliveira","year":"2016","unstructured":"Oliveira, M.V.M., Antonino, P., Ramos, R., Sampaio, A., Mota, A., Roscoe, A.W.: Rigorous development of component-based systems using component metadata and patterns. Formal Aspects Comput. 28, 1\u201368 (2016)","journal-title":"Formal Aspects Comput."},{"issue":"3","key":"3_CR17","doi-asserted-by":"crossref","first-page":"289","DOI":"10.1016\/0890-5401(87)90004-6","volume":"75","author":"AW Roscoe","year":"1987","unstructured":"Roscoe, A.W., Dathi, N.: The pursuit of deadlock freedom. Inf. Comput. 75(3), 289\u2013327 (1987)","journal-title":"Inf. Comput."},{"key":"3_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"133","DOI":"10.1007\/3-540-60630-0_7","volume-title":"Tools and Algorithms for the Construction and Analysis of Systems","author":"AW Roscoe","year":"1995","unstructured":"Roscoe, A.W., Gardiner, P.H.B., Goldsmith, M.H., Hulance, J.R., Jackson, D.M., Scattergood, J.B.: Hierarchical compression for model-checking CSP or how to check 1020 dining philosophers for deadlock. In: Brinksma, E., Cleaveland, W.R., Larsen, K.G., Margaria, T., Steffen, B. (eds.) TACAS 1995. LNCS, vol. 1019, pp. 133\u2013152. Springer, Heidelberg (1995). doi: 10.1007\/3-540-60630-0_7"},{"key":"3_CR19","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-84882-258-0","volume-title":"Understanding Concurrent Systems","author":"AW Roscoe","year":"2010","unstructured":"Roscoe, A.W.: Understanding Concurrent Systems. Springer, Heidelberg (2010)"}],"container-title":["Lecture Notes in Computer Science","FM 2016: Formal Methods"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-48989-6_3","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,6,24]],"date-time":"2017-06-24T22:58:50Z","timestamp":1498345130000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-48989-6_3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016]]},"ISBN":["9783319489889","9783319489896"],"references-count":19,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-48989-6_3","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2016]]}}}