{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T12:53:50Z","timestamp":1742993630413,"version":"3.40.3"},"publisher-location":"Cham","reference-count":26,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030171834"},{"type":"electronic","value":"9783030171841"}],"license":[{"start":{"date-parts":[[2019,1,1]],"date-time":"2019-01-01T00:00:00Z","timestamp":1546300800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2019]]},"DOI":"10.1007\/978-3-030-17184-1_24","type":"book-chapter","created":{"date-parts":[[2019,4,6]],"date-time":"2019-04-06T17:34:04Z","timestamp":1554572044000},"page":"668-693","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["A Process Algebra for Link Layer Protocols"],"prefix":"10.1007","author":[{"given":"Rob","family":"van Glabbeek","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Peter","family":"H\u00f6fner","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Michael","family":"Markl","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2019,4,6]]},"reference":[{"issue":"3","key":"24_CR1","doi-asserted-by":"publisher","first-page":"535","DOI":"10.1109\/49.840210","volume":"18","author":"G Bianchi","year":"2000","unstructured":"Bianchi, G.: Performance analysis of the IEEE 802.11 distributed coordination function. IEEE J. Sel. Areas Commun. 18(3), 535\u2013547 (2000). \n                      https:\/\/doi.org\/10.1109\/49.840210","journal-title":"IEEE J. Sel. Areas Commun."},{"key":"24_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"95","DOI":"10.1007\/978-3-662-49498-1_5","volume-title":"Programming Languages and Systems","author":"E Bres","year":"2016","unstructured":"Bres, E., van Glabbeek, R.J., H\u00f6fner, P.: A timed process algebra for wireless networks with an application in routing. In: Thiemann, P. (ed.) ESOP 2016. LNCS, vol. 9632, pp. 95\u2013122. Springer, Heidelberg (2016). \n                      https:\/\/doi.org\/10.1007\/978-3-662-49498-1_5"},{"issue":"3","key":"24_CR3","doi-asserted-by":"publisher","first-page":"537","DOI":"10.1007\/s00165-012-0270-3","volume":"26","author":"M Calder","year":"2014","unstructured":"Calder, M., Sevegnani, M.: Modelling IEEE 802.11 CSMA\/CA RTS\/CTS with stochastic bigraphs with sharing. Formal Aspects Comput. 26(3), 537\u2013561 (2014). \n                      https:\/\/doi.org\/10.1007\/s00165-012-0270-3","journal-title":"Formal Aspects Comput."},{"key":"24_CR4","doi-asserted-by":"publisher","first-page":"217","DOI":"10.1023\/A:1019109301754","volume":"3","author":"HS Chhaya","year":"1997","unstructured":"Chhaya, H.S., Gupta, S.: Performance modeling of asynchronous data transfer methods of IEEE 802.11 MAC Protocol. Wirel. Netw. 3, 217\u2013234 (1997). \n                      https:\/\/doi.org\/10.1023\/A:1019109301754","journal-title":"Wirel. Netw."},{"key":"24_CR5","volume-title":"Computer Networks and Internets","author":"D Comer","year":"2009","unstructured":"Comer, D.: Computer Networks and Internets. Pearson Education Inc., UpperSaddle River (2009)"},{"key":"24_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"447","DOI":"10.1007\/978-3-540-85361-9_35","volume-title":"CONCUR 2008 - Concurrency Theory","author":"S Cranen","year":"2008","unstructured":"Cranen, S., Mousavi, M.R., Reniers, M.A.: A rule format for associativity. In: van Breugel, F., Chechik, M. (eds.) CONCUR 2008. LNCS, vol. 5201, pp. 447\u2013461. Springer, Heidelberg (2008). \n                      https:\/\/doi.org\/10.1007\/978-3-540-85361-9_35"},{"issue":"2","key":"24_CR7","doi-asserted-by":"publisher","first-page":"458","DOI":"10.1145\/201019.201032","volume":"42","author":"R Nicola De","year":"1995","unstructured":"De Nicola, R., Vaandrager, F.W.: Three logics for branching bisimulation. J. ACM 42(2), 458\u2013487 (1995). \n                      https:\/\/doi.org\/10.1145\/201019.201032","journal-title":"J. ACM"},{"key":"24_CR8","doi-asserted-by":"publisher","unstructured":"Deng, Y., van Glabbeek, R.J., Hennessy, M., Morgan, C.C., Zhang, C.: Remarks on testing probabilistic processes. In: Cardelli, L., Fiore, M., Winskel, G. (eds.) Computation, Meaning, and Logic: Articles Dedicated to Gordon Plotkin, Electronic Notes in Theoretical Computer Science, vol. 172, pp. 359\u2013397. Elsevier (2007). \n                      https:\/\/doi.org\/10.1016\/j.entcs.2007.02.013","DOI":"10.1016\/j.entcs.2007.02.013"},{"key":"24_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"363","DOI":"10.1007\/978-3-540-71316-6_25","volume-title":"Programming Languages and Systems","author":"Y Deng","year":"2007","unstructured":"Deng, Y., van Glabbeek, R.J., Morgan, C.C., Zhang, C.: Scalar outcomes suffice for finitary probabilistic testing. In: De Nicola, R. (ed.) ESOP 2007. LNCS, vol. 4421, pp. 363\u2013378. Springer, Heidelberg (2007). \n                      https:\/\/doi.org\/10.1007\/978-3-540-71316-6_25"},{"key":"24_CR10","doi-asserted-by":"publisher","unstructured":"Duflot, M., et al.: Probabilistic model checking of the CSMA\/CD, protocol using PRISM and APMC. In: Automated Verification of Critical Systems (AVoCS 2004). Electronic Notes in Theoretical Computer Science Series, vol. 128, pp. 195\u2013214 (2004). \n                      https:\/\/doi.org\/10.1016\/j.entcs.2005.04.012","DOI":"10.1016\/j.entcs.2005.04.012"},{"key":"24_CR11","doi-asserted-by":"publisher","unstructured":"Duflot, M., et al.: Practical applications of probabilistic model checking to communication protocols. In: Gnesi, S., Margaria, T. (eds.) Formal Methods for Industrial Critical Systems: A Survey of Applications, pp. 133\u2013150. IEEE (2013). \n                      https:\/\/doi.org\/10.1002\/9781118459898.ch7","DOI":"10.1002\/9781118459898.ch7"},{"key":"24_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"295","DOI":"10.1007\/978-3-642-28869-2_15","volume-title":"Programming Languages and Systems","author":"A Fehnker","year":"2012","unstructured":"Fehnker, A., van Glabbeek, R.J., H\u00f6fner, P., McIver, A.K., Portmann, M., Tan, W.L.: A process algebra for wireless mesh networks. In: Seidl, H. (ed.) ESOP 2012. LNCS, vol. 7211, pp. 295\u2013315. Springer, Heidelberg (2012). \n                      https:\/\/doi.org\/10.1007\/978-3-642-28869-2_15"},{"key":"24_CR13","unstructured":"Fehnker, A., van Glabbeek, R.J., H\u00f6fner, P., McIver, A.K., Portmann, M., Tan, W.L.: A process algebra for wireless mesh networks used for modelling, verifying and analysing AODV. Technical report 5513, NICTA (2013). \n                      http:\/\/arxiv.org\/abs\/1312.7645"},{"key":"24_CR14","volume-title":"Understanding Data Communications","author":"GE Friend","year":"1988","unstructured":"Friend, G.E., Fike, J.L., Baker, H.C., Bellamy, J.C.: Understanding Data Communications, 2nd edn. Howard W. Sams & Company, Indianapolis (1988)","edition":"2"},{"key":"24_CR15","doi-asserted-by":"publisher","unstructured":"Fruth, M.: Probabilistic model checking of contention resolution in the IEEE 802.15.4 low-rate wireless personal area network protocol. In: Leveraging Applications of Formal Methods, Second International Symposium (ISoLA 2006), pp. 290\u2013297. IEEE Computer Society (2006). \n                      https:\/\/doi.org\/10.1109\/ISoLA.2006.34","DOI":"10.1109\/ISoLA.2006.34"},{"key":"24_CR16","doi-asserted-by":"publisher","unstructured":"IEEE: IEEE standard for ethernet (2016). \n                      https:\/\/doi.org\/10.1109\/IEEESTD.2016.7428776","DOI":"10.1109\/IEEESTD.2016.7428776"},{"key":"24_CR17","doi-asserted-by":"publisher","unstructured":"IEEE: IEEE standard for low-rate wireless networks (2016). \n                      https:\/\/doi.org\/10.1109\/IEEESTD.2016.7460875","DOI":"10.1109\/IEEESTD.2016.7460875"},{"key":"24_CR18","unstructured":"ISO\/IEC 7498\u20131: Information technology\u2014open systems interconnection\u2014basic reference model: The basic model (1994). \n                      https:\/\/www.iso.org\/standard\/20269.html"},{"key":"24_CR19","unstructured":"ISO\/IEC\/IEEE 8802\u201311: Information technology\u2014telecommunications and information exchange between systems\u2014local and metropolitan area networks\u2014specific requirements\u2014part 11: Wireless LAN medium access control (MAC) and physical layer (PHY) specifications (2018). \n                      https:\/\/www.iso.org\/standard\/73367.html"},{"key":"24_CR20","doi-asserted-by":"publisher","unstructured":"Jensen, H.E., Larsen, K.G., Skou, A.: Modelling and analysis of a collision avoidance protocol using Spin and Uppaal. In: The Spin Verification System. Discrete Mathematics and Theoretical Computer Science, vol. 32, pp. 33\u201350. DIMACS\/AMS (1996). \n                      https:\/\/doi.org\/10.7146\/brics.v3i24.20005","DOI":"10.7146\/brics.v3i24.20005"},{"key":"24_CR21","unstructured":"Parrow, J.: Verifying a CSMA\/CD-protocol with CCS. In: Aggarwal, S. (eds.) IFIP Symposium on Protocol Specification, Testing and Verification (PSTV 1988), North-Holland, pp. 373\u2013384 (1988)"},{"key":"24_CR22","doi-asserted-by":"publisher","unstructured":"Pnueli, A.: The temporal logic of programs. In: Foundations of Computer Science (FOCS 1977), pp. 46\u201357. IEEE (1977). \n                      https:\/\/doi.org\/10.1109\/SFCS.1977.32","DOI":"10.1109\/SFCS.1977.32"},{"key":"24_CR23","doi-asserted-by":"publisher","first-page":"245","DOI":"10.1016\/0304-3975(85)90093-3","volume":"37","author":"R Simone de","year":"1985","unstructured":"de Simone, R.: Higher-level synchronising devices in Meije-SCCS. TCS 37, 245\u2013267 (1985). \n                      https:\/\/doi.org\/10.1016\/0304-3975(85)90093-3","journal-title":"TCS"},{"key":"24_CR24","unstructured":"Simpson, W.: The point-to-point protocol (PPP). RFC 1661 Internet Standard (1994). \n                      http:\/\/www.ietf.org\/rfc\/rfc1661.txt"},{"key":"24_CR25","doi-asserted-by":"publisher","first-page":"440","DOI":"10.1016\/j.scico.2009.07.008","volume":"75","author":"A Singh","year":"2010","unstructured":"Singh, A., Ramakrishnan, C.R., Smolka, S.A.: A process calculus for mobile ad hoc networks. Sci. Comput. Program. 75, 440\u2013469 (2010). \n                      https:\/\/doi.org\/10.1016\/j.scico.2009.07.008","journal-title":"Sci. Comput. Program."},{"key":"24_CR26","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"34","DOI":"10.1007\/978-3-540-40903-8_4","volume-title":"Formal Modeling and Analysis of Timed Systems","author":"J Zhao","year":"2004","unstructured":"Zhao, J., Li, X., Zheng, T., Zheng, G.: Removing irrelevant atomic formulas for checking timed automata efficiently. In: Larsen, K.G., Niebert, P. (eds.) FORMATS 2003. LNCS, vol. 2791, pp. 34\u201345. Springer, Heidelberg (2004). \n                      https:\/\/doi.org\/10.1007\/978-3-540-40903-8_4"}],"container-title":["Lecture Notes in Computer Science","Programming Languages and Systems"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-17184-1_24","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,20]],"date-time":"2019-05-20T09:24:21Z","timestamp":1558344261000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-030-17184-1_24"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019]]},"ISBN":["9783030171834","9783030171841"],"references-count":26,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-17184-1_24","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2019]]},"assertion":[{"value":"6 April 2019","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"ESOP","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"European Symposium on Programming","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Prague","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Czech Republic","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2019","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"8 April 2019","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"11 April 2019","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"28","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"esop2019","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/www.etaps.org\/2019\/esop","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Single-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}},{"value":"EasyChair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}},{"value":"86","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}},{"value":"28","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}},{"value":"0","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}},{"value":"33% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}},{"value":"3,2","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}},{"value":"12","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}},{"value":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}}]}}