{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,4,7]],"date-time":"2025-04-07T11:10:07Z","timestamp":1744024207116,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":24,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642329425"},{"type":"electronic","value":"9783642329432"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2012]]},"DOI":"10.1007\/978-3-642-32943-2_14","type":"book-chapter","created":{"date-parts":[[2012,8,28]],"date-time":"2012-08-28T04:59:35Z","timestamp":1346129975000},"page":"168-182","source":"Crossref","is-referenced-by-count":4,"title":["Model Checking under Fairness in ProB and Its Application to Fair Exchange Protocols"],"prefix":"10.1007","author":[{"given":"David M.","family":"Williams","sequence":"first","affiliation":[]},{"given":"Joeri","family":"de Ruiter","sequence":"additional","affiliation":[]},{"given":"Wan","family":"Fokkink","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"14_CR1","doi-asserted-by":"crossref","unstructured":"Hoare, C.A.R.: Communicating Sequential Processes. Prentice-Hall (1985)","DOI":"10.1007\/978-3-642-82921-5_4"},{"key":"14_CR2","unstructured":"Gardiner, P., Goldsmith, M., Hulance, J., Jackson, D., Roscoe, B., Scattergood, B., Armstrong, P.: FDR Manual. Oxford University (2010)"},{"key":"14_CR3","doi-asserted-by":"publisher","first-page":"277","DOI":"10.1007\/s00165-007-0065-0","volume":"20","author":"G. Lowe","year":"2008","unstructured":"Lowe, G.: Specification of communicating processes: Temporal logic versus refusals-based refinement. Formal Aspects of Computing\u00a020, 277\u2013294 (2008)","journal-title":"Formal Aspects of Computing"},{"key":"14_CR4","doi-asserted-by":"crossref","unstructured":"Murray, T.: On the limits of refinement-testing for model-checking CSP. Formal Aspects of Computing (to appear, 2012)","DOI":"10.1007\/s00165-011-0183-6"},{"key":"14_CR5","doi-asserted-by":"publisher","first-page":"9","DOI":"10.1007\/s10009-009-0132-3","volume":"12","author":"D. Plagge","year":"2010","unstructured":"Plagge, D., Leuschel, M.: Seven at one stroke: LTL model checking for high-level specifications in B, Z, CSP, and more. Software Tools for Technology Transfer\u00a012, 9\u201321 (2010)","journal-title":"Software Tools for Technology Transfer"},{"key":"14_CR6","doi-asserted-by":"publisher","first-page":"198","DOI":"10.1109\/TIT.1983.1056650","volume":"29","author":"D. Dolev","year":"1983","unstructured":"Dolev, D., Yao, A.: On the security of public key protocols. IEEE Transactions on Information Theory\u00a029, 198\u2013208 (1983)","journal-title":"IEEE Transactions on Information Theory"},{"key":"14_CR7","doi-asserted-by":"publisher","first-page":"1606","DOI":"10.1016\/S0140-3664(02)00049-X","volume":"25","author":"S. Kremer","year":"2002","unstructured":"Kremer, S., Markowitch, O., Zhou, J.: An intensive survey of fair non-repudiation protocols. Computer Communications\u00a025, 1606\u20131621 (2002)","journal-title":"Computer Communications"},{"key":"14_CR8","unstructured":"Asokan, N.: Fairness in electronic commerce. Technical report, University of Waterloo (1998)"},{"key":"14_CR9","doi-asserted-by":"crossref","unstructured":"Cederquist, J., Torabi Dashti, M.: An intruder model for verifying liveness in security protocols. In: Proc. FMSE 2006, pp. 23\u201332. ACM (2006)","DOI":"10.1145\/1180337.1180340"},{"key":"14_CR10","doi-asserted-by":"crossref","unstructured":"Roscoe, A.: Understanding Concurrent Systems. Springer (2010)","DOI":"10.1007\/978-1-84882-258-0"},{"key":"14_CR11","doi-asserted-by":"crossref","unstructured":"Francez, N.: Fairness. Springer (1986)","DOI":"10.1007\/978-1-4612-4886-6"},{"key":"14_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"202","DOI":"10.1007\/3-540-44685-0_14","volume-title":"CONCUR 2001 - Concurrency Theory","author":"A. Puhakka","year":"2001","unstructured":"Puhakka, A., Valmari, A.: Liveness and Fairness in Process-Algebraic Verification. In: Larsen, K.G., Nielsen, M. (eds.) CONCUR 2001. LNCS, vol.\u00a02154, pp. 202\u2013217. Springer, Heidelberg (2001)"},{"key":"14_CR13","unstructured":"Torabi Dashti, M.: Keeping Fairness Alive. PhD thesis, VU University Amsterdam (2008)"},{"key":"14_CR14","doi-asserted-by":"publisher","first-page":"185","DOI":"10.1007\/s10009-007-0063-9","volume":"10","author":"M. Leuschel","year":"2008","unstructured":"Leuschel, M., Butler, M.: ProB: An automated analysis toolset for the B method. Software Tools for Technology Transfer\u00a010, 185\u2013203 (2008)","journal-title":"Software Tools for Technology Transfer"},{"key":"14_CR15","unstructured":"Fokkink, W.J.: Modelling Distributed Systems. Springer (2007)"},{"key":"14_CR16","doi-asserted-by":"publisher","first-page":"255","DOI":"10.1016\/S0167-6423(02)00094-1","volume":"46","author":"R. Mateescu","year":"2003","unstructured":"Mateescu, R., Sighireanu, M.: Efficient on-the-fly model checking for regular alternation-free mu-calculus. Science of Computer Programming\u00a046, 255\u2013281 (2003)","journal-title":"Science of Computer Programming"},{"key":"14_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"372","DOI":"10.1007\/978-3-642-19835-9_33","volume-title":"Tools and Algorithms for the Construction and Analysis of Systems","author":"H. Garavel","year":"2011","unstructured":"Garavel, H., Lang, F., Mateescu, R., Serwe, W.: CADP 2010: A Toolbox for the Construction and Analysis of Distributed Processes. In: Abdulla, P.A., Leino, K.R.M. (eds.) TACAS 2011. LNCS, vol.\u00a06605, pp. 372\u2013387. Springer, Heidelberg (2011)"},{"key":"14_CR18","unstructured":"Roscoe, A.W.: The Theory and Practice of Concurrency. Prentice-Hall (1998)"},{"key":"14_CR19","doi-asserted-by":"crossref","unstructured":"Schneider, S.: Formal analysis of a non-repudiation protocol. In: Proc. CSF 1998, pp. 54\u201365. IEEE (1998)","DOI":"10.1109\/CSFW.1998.683155"},{"key":"14_CR20","doi-asserted-by":"publisher","first-page":"253","DOI":"10.1016\/j.jlap.2004.09.005","volume":"64","author":"N. Evans","year":"2005","unstructured":"Evans, N., Schneider, S.: Verifying security protocols with PVS: Widening the rank function approach. Journal of Logic and Algebraic Programming\u00a064, 253\u2013284 (2005)","journal-title":"Journal of Logic and Algebraic Programming"},{"key":"14_CR21","unstructured":"Zhou, J., Gollman, D.: A fair non-repudiation protocol. In: S&P 1996, pp. 55\u201361. IEEE (1996)"},{"key":"14_CR22","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"244","DOI":"10.1007\/11679219_18","volume-title":"Formal Aspects in Security and Trust","author":"K. Wei","year":"2006","unstructured":"Wei, K., Heather, J.: Towards Verification of Timed Non-repudiation Protocols. In: Dimitrakos, T., Martinelli, F., Ryan, P.Y.A., Schneider, S. (eds.) FAST 2005. LNCS, vol.\u00a03866, pp. 244\u2013257. Springer, Heidelberg (2006)"},{"key":"14_CR23","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"202","DOI":"10.1007\/978-3-540-75227-1_14","volume-title":"Formal Aspects in Security and Trust","author":"K. Wei","year":"2007","unstructured":"Wei, K., Heather, J.: A Theorem-Proving Approach to Verification of Fair Non-repudiation Protocols. In: Dimitrakos, T., Martinelli, F., Ryan, P.Y.A., Schneider, S. (eds.) FAST 2006. LNCS, vol.\u00a04691, pp. 202\u2013219. Springer, Heidelberg (2007)"},{"key":"14_CR24","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"709","DOI":"10.1007\/978-3-642-02658-4_59","volume-title":"Computer Aided Verification","author":"J. Sun","year":"2009","unstructured":"Sun, J., Liu, Y., Dong, J.S., Pang, J.: PAT: Towards Flexible Verification under Fairness. In: Bouajjani, A., Maler, O. (eds.) CAV 2009. LNCS, vol.\u00a05643, pp. 709\u2013714. Springer, Heidelberg (2009)"}],"container-title":["Lecture Notes in Computer Science","Theoretical Aspects of Computing \u2013 ICTAC 2012"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-32943-2_14","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,4,7]],"date-time":"2025-04-07T10:33:50Z","timestamp":1744022030000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-32943-2_14"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012]]},"ISBN":["9783642329425","9783642329432"],"references-count":24,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-32943-2_14","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2012]]}}}