{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T16:55:52Z","timestamp":1725641752472},"publisher-location":"Berlin, Heidelberg","reference-count":18,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642258725"},{"type":"electronic","value":"9783642258732"}],"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-25873-2_33","type":"book-chapter","created":{"date-parts":[[2011,12,8]],"date-time":"2011-12-08T15:16:34Z","timestamp":1323357394000},"page":"481-496","source":"Crossref","is-referenced-by-count":1,"title":["Constructing Mid-Points for Two-Party Asynchronous Protocols"],"prefix":"10.1007","author":[{"given":"Petar","family":"Tsankov","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Mohammad","family":"Torabi-Dashti","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"David","family":"Basin","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"33_CR1","doi-asserted-by":"publisher","first-page":"77","DOI":"10.1016\/0304-3975(85)90088-X","volume":"37","author":"J. Bergstra","year":"1985","unstructured":"Bergstra, J., Klop, J.: Algebra of communicating processes with abstraction. Theor. Comput. Sci.\u00a037, 77\u2013121 (1985)","journal-title":"Theor. Comput. Sci."},{"key":"33_CR2","doi-asserted-by":"crossref","unstructured":"Bhargavan, K., Chandra, S., McCann, P., Gunter, C.: What packets may come: Automata for network monitoring. In: POPL, pp. 206\u2013219. ACM (2001)","DOI":"10.1145\/373243.360221"},{"key":"33_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"46","DOI":"10.1007\/978-3-540-72738-5_4","volume-title":"Applied Cryptography and Network Security","author":"D. Bidder-Senn von","year":"2007","unstructured":"von Bidder-Senn, D., Basin, D., Caronni, G.: Midpoints Versus Endpoints: From Protocols to Firewalls. In: Katz, J., Yung, M. (eds.) ACNS 2007. LNCS, vol.\u00a04521, pp. 46\u201364. Springer, Heidelberg (2007)"},{"key":"33_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"683","DOI":"10.1007\/978-3-540-71209-1_53","volume-title":"Tools and Algorithms for the Construction and Analysis of Systems","author":"S. Blom","year":"2007","unstructured":"Blom, S., Calam\u00e9, J.R., Lisser, B., Orzan, S., Pang, J., van de Pol, J., Dashti, M.T., Wijs, A.J.: Distributed Analysis with \u03bcCRL: A Compendium of Case Studies. In: Grumberg, O., Huth, M. (eds.) TACAS 2007. LNCS, vol.\u00a04424, pp. 683\u2013689. Springer, Heidelberg (2007)"},{"key":"33_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"250","DOI":"10.1007\/3-540-44585-4_23","volume-title":"Computer Aided Verification","author":"S. Blom","year":"2001","unstructured":"Blom, S., Fokkink, W., Groote, J.F., van Langevelde, I., Lisser, B., van de Pol, J.: \u03bcCRL: A Toolset for Analysing Algebraic Specifications. In: Berry, G., Comon, H., Finkel, A. (eds.) CAV 2001. LNCS, vol.\u00a02102, pp. 250\u2013254. Springer, Heidelberg (2001)"},{"key":"33_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"354","DOI":"10.1007\/978-3-642-14295-6_31","volume-title":"Computer Aided Verification","author":"S. Blom","year":"2010","unstructured":"Blom, S., van de Pol, J., Weber, M.: LTSmin: Distributed and Symbolic Reachability. In: Touili, T., Cook, B., Jackson, P. (eds.) CAV 2010. LNCS, vol.\u00a06174, pp. 354\u2013359. Springer, Heidelberg (2010)"},{"key":"33_CR7","doi-asserted-by":"crossref","unstructured":"Brucker, A., Br\u00fcgger, L., Kearney, P., Wolff, B.: Verified firewall policy transformations for test case generation. In: ICST, pp. 345\u2013354. IEEE Computer Society (2010)","DOI":"10.1109\/ICST.2010.50"},{"key":"33_CR8","doi-asserted-by":"crossref","unstructured":"Brucker, A.D., Br\u00fcgger, L., Wolff, B.: Model-based firewall conformance testing. In: 8th International Workshop on Formal Approaches to Testing of Software, Tokyo, Japan, pp. 103\u2013118 (2008)","DOI":"10.1007\/978-3-540-68524-1_9"},{"key":"33_CR9","doi-asserted-by":"crossref","unstructured":"Postel, J. (ed.): Transmission control protocol (1981)","DOI":"10.17487\/rfc0793"},{"key":"33_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"437","DOI":"10.1007\/3-540-61474-5_97","volume-title":"Computer Aided Verification","author":"J. Fernandez","year":"1996","unstructured":"Fernandez, J., Garavel, H., Kerbrat, A., Mounier, L., Mateescu, R., Sighireanu, M.: CADP - A Protocol Validation and Verification Toolbox. In: Alur, R., Henzinger, T.A. (eds.) CAV 1996. LNCS, vol.\u00a01102, pp. 437\u2013440. Springer, Heidelberg (1996)"},{"key":"33_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"66","DOI":"10.1007\/3-540-57208-2_6","volume-title":"CONCUR\u201993","author":"R. Glabbeek van","year":"1993","unstructured":"van Glabbeek, R.: The linear time \u2013 branching time spectrum II. In: Best, E. (ed.) CONCUR 1993. LNCS, vol.\u00a0715, pp. 66\u201381. Springer, Heidelberg (1993)"},{"key":"#cr-split#-33_CR12.1","doi-asserted-by":"crossref","unstructured":"Groote, J., Ponse, A.: The syntax and semantics of ??CRL. In: Algebra of Communicating Processes 1994. Workshops in Computing Series, pp. 26???62. Springer, Heidelberg (1995);","DOI":"10.1007\/978-1-4471-2120-6_2"},{"key":"#cr-split#-33_CR12.2","unstructured":"Also as technical report CS-R9076, CWI, Amsterdam, The Netherlands (December 1990)"},{"issue":"3","key":"33_CR13","doi-asserted-by":"publisher","first-page":"125","DOI":"10.1007\/s10207-005-0074-z","volume":"5","author":"A. Mayer","year":"2006","unstructured":"Mayer, A., Wool, A., Ziskind, E.: Offline firewall analysis. Int. J. Inf. Sec.\u00a05(3), 125\u2013144 (2006)","journal-title":"Int. J. Inf. Sec."},{"key":"33_CR14","unstructured":"Milner, R.: Communication and concurrency. PHI Series in computer science. Prentice Hall (1989)"},{"key":"33_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"167","DOI":"10.1007\/BFb0017309","volume-title":"TCS","author":"D. Park","year":"1981","unstructured":"Park, D.: Concurrency and automata on infinite sequences. In: Deussen, P. (ed.) TCS 1981. LNCS, vol.\u00a0104, pp. 167\u2013183. Springer, Heidelberg (1981)"},{"key":"33_CR16","doi-asserted-by":"crossref","unstructured":"Paxson, V.: Automated packet trace analysis of TCP implementations. In: SIGCOMM, pp. 167\u2013179. ACM Press (1997)","DOI":"10.1145\/263105.263160"},{"key":"33_CR17","unstructured":"Utting, M., Legeard, B.: Practical Model-Based Testing: A Tools Approach. Morgan Kaufmann (2007)"}],"container-title":["Lecture Notes in Computer Science","Principles of Distributed Systems"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-25873-2_33","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,20]],"date-time":"2019-06-20T15:53:05Z","timestamp":1561045985000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-25873-2_33"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011]]},"ISBN":["9783642258725","9783642258732"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-25873-2_33","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2011]]}}}