{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,19]],"date-time":"2026-06-19T18:18:48Z","timestamp":1781893128083,"version":"3.54.5"},"publisher-location":"Berlin, Heidelberg","reference-count":22,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783662488980","type":"print"},{"value":"9783662488997","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2015]]},"DOI":"10.1007\/978-3-662-48899-7_22","type":"book-chapter","created":{"date-parts":[[2015,11,21]],"date-time":"2015-11-21T03:59:28Z","timestamp":1448078368000},"page":"313-328","source":"Crossref","is-referenced-by-count":5,"title":["On the Expressive Power of Communication Primitives in Parameterised Systems"],"prefix":"10.1007","author":[{"given":"Benjamin","family":"Aminof","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Sasha","family":"Rubin","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Florian","family":"Zuleger","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2015,11,22]]},"reference":[{"issue":"3","key":"22_CR1","doi-asserted-by":"publisher","first-page":"248","DOI":"10.1016\/j.ic.2010.11.003","volume":"209","author":"PA Abdulla","year":"2011","unstructured":"Abdulla, P.A., Delzanno, G., Begin, L.V.: A classification of the expressive power of well-structured transition systems. Inf. Comput. 209(3), 248\u2013279 (2011)","journal-title":"Inf. Comput."},{"key":"22_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"109","DOI":"10.1007\/978-3-662-44584-6_9","volume-title":"CONCUR 2014 \u2013 Concurrency Theory","author":"B Aminof","year":"2014","unstructured":"Aminof, B., Kotek, T., Rubin, S., Spegni, F., Veith, H.: Parameterized model checking of rendezvous systems. In: Baldan, P., Gorla, D. (eds.) CONCUR 2014. LNCS, vol. 8704, pp. 109\u2013124. Springer, Heidelberg (2014)"},{"key":"22_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"375","DOI":"10.1007\/978-3-662-47666-6_30","volume-title":"Automata, Languages, and Programming","author":"B Aminof","year":"2015","unstructured":"Aminof, B., Rubin, S., Zuleger, F., Spegni, F.: Liveness of parameterized timed networks. In: Halld\u00f3rsson, M.M., Iwama, K., Kobayashi, N., Speckmann, B. (eds.) ICALP 2015. LNCS, vol. 9135, pp. 375\u2013387. Springer, Heidelberg (2015)"},{"key":"22_CR4","doi-asserted-by":"publisher","first-page":"97","DOI":"10.1007\/978-3-540-89707-1_5","volume-title":"Middleware for Network Eccentric and Mobile Applications","author":"J Aspnes","year":"2009","unstructured":"Aspnes, J., Ruppert, E.: An introduction to population protocols. In: Garbinato, B., Miranda, H., Rodrigues, L. (eds.) Middleware for Network Eccentric and Mobile Applications, pp. 97\u2013120. Springer, Heidelberg (2009)"},{"key":"22_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"173","DOI":"10.1007\/3-540-46002-0_13","volume-title":"Tools and Algorithms for the Construction and Analysis of Systems","author":"G Delzanno","year":"2002","unstructured":"Delzanno, G., Raskin, J.-F., Van Begin, L.: Towards the automated verification of multithreaded java programs. In: Katoen, J.-P., Stevens, P. (eds.) TACAS 2002. LNCS, vol. 2280, pp. 173\u2013187. Springer, Heidelberg (2002)"},{"key":"22_CR6","unstructured":"Delzanno, G., Sangnier, A., Traverso, R., Zavattaro, G.: The cost of parameterized reachability in mobile ad hoc networks. CoRR abs\/1202.5850 (2012)"},{"key":"22_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"313","DOI":"10.1007\/978-3-642-15375-4_22","volume-title":"CONCUR 2010 - Concurrency Theory","author":"G Delzanno","year":"2010","unstructured":"Delzanno, G., Sangnier, A., Zavattaro, G.: Parameterized verification of ad hoc networks. In: Gastin, P., Laroussinie, F. (eds.) CONCUR 2010. LNCS, vol. 6269, pp. 313\u2013327. Springer, Heidelberg (2010)"},{"key":"22_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"235","DOI":"10.1007\/978-3-642-30793-5_15","volume-title":"Formal Techniques for Distributed Systems","author":"G Delzanno","year":"2012","unstructured":"Delzanno, G., Sangnier, A., Zavattaro, G.: Verification of ad hoc networks with node and communication failures. In: Giese, H., Rosu, G. (eds.) FORTE 2012 and FMOODS 2012. LNCS, vol. 7273, pp. 235\u2013250. Springer, Heidelberg (2012)"},{"key":"22_CR9","doi-asserted-by":"crossref","unstructured":"Emerson, E., Kahlon, V.: Model checking guarded protocols. In: LICS, pp. 361\u2013370. IEEE (2003)","DOI":"10.1109\/LICS.2003.1210076"},{"key":"22_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"236","DOI":"10.1007\/10721959_19","volume-title":"Automated Deduction - CADE-17","author":"E Emerson","year":"2000","unstructured":"Emerson, E., Kahlon, V.: Reducing model checking of the many to the few. In: McAllester, D. (ed.) CADE 2000. LNCS, vol. 1831, pp. 236\u2013254. Springer, Heidelberg (2000)"},{"key":"22_CR11","unstructured":"Esparza, J.: Keeping a crowd safe: on the complexity of parameterized verification. In: STACS (2014)"},{"key":"22_CR12","doi-asserted-by":"crossref","unstructured":"Esparza, J., Finkel, A., Mayr, R.: On the verification of broadcast protocols. In: LICS, p. 352. IEEE (1999)","DOI":"10.1109\/LICS.1999.782630"},{"key":"22_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"124","DOI":"10.1007\/978-3-642-39799-8_8","volume-title":"Computer Aided Verification","author":"J Esparza","year":"2013","unstructured":"Esparza, J., Ganty, P., Majumdar, R.: Parameterized verification of asynchronous shared-memory systems. In: Sharygina, N., Veith, H. (eds.) CAV 2013. LNCS, vol. 8044, pp. 124\u2013140. Springer, Heidelberg (2013)"},{"issue":"3","key":"22_CR14","doi-asserted-by":"publisher","first-page":"374","DOI":"10.1016\/j.tcs.2006.02.008","volume":"356","author":"A Finkel","year":"2006","unstructured":"Finkel, A., Geeraerts, G., Raskin, J., Begin, L.V.: On the omega-language expressive power of extended petri nets. Theor. Comput. Sci. 356(3), 374\u2013386 (2006)","journal-title":"Theor. Comput. Sci."},{"issue":"11","key":"22_CR15","doi-asserted-by":"publisher","first-page":"1239","DOI":"10.1038\/nbt1356","volume":"25","author":"J Fisher","year":"2007","unstructured":"Fisher, J., Henzinger, T.A.: Executable cell biology. Nat. Biotechnol. 25(11), 1239\u20131249 (2007)","journal-title":"Nat. Biotechnol."},{"issue":"3\u20134","key":"22_CR16","doi-asserted-by":"publisher","first-page":"249","DOI":"10.1007\/s00236-007-0050-3","volume":"44","author":"G Geeraerts","year":"2007","unstructured":"Geeraerts, G., Raskin, J., Begin, L.V.: Well-structured languages. Acta Inf. 44(3\u20134), 249\u2013288 (2007)","journal-title":"Acta Inf."},{"issue":"3","key":"22_CR17","doi-asserted-by":"publisher","first-page":"675","DOI":"10.1145\/146637.146681","volume":"39","author":"SM German","year":"1992","unstructured":"German, S.M., Sistla, A.P.: Reasoning about systems with many processes. J. ACM 39(3), 675\u2013735 (1992)","journal-title":"J. ACM"},{"key":"22_CR18","volume-title":"Distributed Algorithms","author":"N Lynch","year":"1996","unstructured":"Lynch, N.: Distributed Algorithms. Morgan Kaufman, San Francisco (1996)"},{"key":"22_CR19","volume-title":"Computation: Finite and Infinite Machines","author":"ML Minsky","year":"1967","unstructured":"Minsky, M.L.: Computation: Finite and Infinite Machines. Prentice-Hall, Upper Saddle River (1967)"},{"issue":"2\u20133","key":"22_CR20","doi-asserted-by":"publisher","first-page":"285","DOI":"10.1016\/0167-6423(95)00017-8","volume":"25","author":"KVS Prasad","year":"1995","unstructured":"Prasad, K.V.S.: A calculus of broadcasting systems. Sci. Comput. Program. 25(2\u20133), 285\u2013327 (1995)","journal-title":"Sci. Comput. Program."},{"key":"22_CR21","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"5","DOI":"10.1007\/978-3-642-40184-8_2","volume-title":"CONCUR 2013 \u2013 Concurrency Theory","author":"S Schmitz","year":"2013","unstructured":"Schmitz, S., Schnoebelen, P.: The power of well-structured systems. In: D\u2019Argenio, P.R., Melgratti, H. (eds.) CONCUR 2013. LNCS, vol. 8052, pp. 5\u201324. Springer, Heidelberg (2013)"},{"key":"22_CR22","doi-asserted-by":"crossref","unstructured":"Vardi, M.Y.: An automata-theoretic approach to linear temporal logic. In: Banff Higher Order Workshop, pp. 238\u2013266 (1995)","DOI":"10.1007\/3-540-60915-6_6"}],"container-title":["Lecture Notes in Computer Science","Logic for Programming, Artificial Intelligence, and Reasoning"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-662-48899-7_22","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,5,31]],"date-time":"2025-05-31T13:28:15Z","timestamp":1748698095000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-662-48899-7_22"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015]]},"ISBN":["9783662488980","9783662488997"],"references-count":22,"URL":"https:\/\/doi.org\/10.1007\/978-3-662-48899-7_22","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2015]]}}}