{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,28]],"date-time":"2025-03-28T10:10:12Z","timestamp":1743156612711,"version":"3.40.3"},"publisher-location":"Cham","reference-count":29,"publisher":"Springer Nature Switzerland","isbn-type":[{"type":"print","value":"9783031506277"},{"type":"electronic","value":"9783031506284"}],"license":[{"start":{"date-parts":[[2023,12,28]],"date-time":"2023-12-28T00:00:00Z","timestamp":1703721600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,12,28]],"date-time":"2023-12-28T00:00:00Z","timestamp":1703721600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2024]]},"DOI":"10.1007\/978-3-031-50628-4_4","type":"book-chapter","created":{"date-parts":[[2023,12,27]],"date-time":"2023-12-27T18:02:14Z","timestamp":1703700134000},"page":"44-79","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["The Impact of\u00a0Propositional Messages on\u00a0Termination of\u00a0Declarative Distributed Systems"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-5692-5681","authenticated-orcid":false,"given":"Francesco","family":"Di Cosmo","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2023,12,28]]},"reference":[{"key":"4_CR1","doi-asserted-by":"crossref","unstructured":"Abiteboul, S., Abrams, Z., Haar, S., Milo, T.: Diagnosis of asynchronous discrete event systems: datalog to the rescue! In: Proceedings of PODS, pp. 358\u2013367. ACM Press (2005)","DOI":"10.1145\/1065167.1065214"},{"key":"4_CR2","doi-asserted-by":"crossref","unstructured":"Abiteboul, S., Bienvenu, M., Galland, A., Antoine, \u00c9.: A rule-based language for web data management. In: Proceedings of PODS, pp. 293\u2013304. ACM Press (2011)","DOI":"10.1145\/1989284.1989320"},{"key":"4_CR3","volume-title":"Foundations of Databases","author":"S Abiteboul","year":"1995","unstructured":"Abiteboul, S., Hull, R., Vianu, V.: Foundations of Databases. Addison-Wesley, Boston (1995)"},{"key":"4_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1007\/978-3-030-67087-0_1","volume-title":"Networked Systems","author":"C Aiswarya","year":"2021","unstructured":"Aiswarya, C.: On network topologies and the decidability of reachability problem. In: Georgiou, C., Majumdar, R. (eds.) NETYS 2020. LNCS, vol. 12129, pp. 3\u201310. Springer, Cham (2021). https:\/\/doi.org\/10.1007\/978-3-030-67087-0_1"},{"key":"4_CR5","doi-asserted-by":"crossref","unstructured":"Ameloot, T.J., Geck, G., Ketsman, B., Neven, F., Schwentick, T.: Parallel-correctness and transferability for conjunctive queries. In: Proceedings of PODS, pp. 47\u201358 (2015)","DOI":"10.1145\/2745754.2745759"},{"key":"4_CR6","doi-asserted-by":"crossref","unstructured":"Ameloot, T.J., Ketsman, B., Neven, F., Zinn, D.: Weaker forms of monotonicity for declarative networking: a more fine-grained answer to the CALM-conjecture. In: Proceedings of PODS, pp. 64\u201375 (2014)","DOI":"10.1145\/2594538.2594541"},{"key":"4_CR7","doi-asserted-by":"crossref","unstructured":"Ameloot, T.J., Neven, F., Van den Bussche, J.: Relational transducers for declarative networking. JACM 60(2), 15:1\u201315:38 (2013)","DOI":"10.1145\/2450142.2450151"},{"key":"4_CR8","doi-asserted-by":"crossref","unstructured":"Bagheri Hariri, B., Calvanese, D., De Giacomo, G., Deutsch, A., Montali, M.: Verification of relational data-centric dynamic systems with external services. In: Proceedings of PODS, pp. 163\u2013174 (2013)","DOI":"10.1145\/2463664.2465221"},{"key":"4_CR9","doi-asserted-by":"crossref","unstructured":"Bagheri Hariri, B., Calvanese, D., De Giacomo, G., Deutsch, A., Montali, M.: Verification of relational data-centric dynamic systems with external services. In: Hull, R., Fan, W. (eds.) Proceedings of the 32nd ACM SIGMOD-SIGACT-SIGART Symposium on Principles of Database Systems, PODS 2013, New York, NY, USA, 22\u201327 June 2013, pp. 163\u2013174. ACM (2013)","DOI":"10.1145\/2463664.2465221"},{"key":"4_CR10","unstructured":"Calvanese, D., Di Cosmo, F., Lobo, J., Montali, M.: Convergence verification of declarative distributed systems. In: Monica, S., Bergenti, F. (eds.) Proceedings of the 36th Italian Conference on Computational Logic, Parma, Italy, 7\u20139 September 2021, CEUR Workshop Proceedings, vol. 3002, pp. 62\u201376. CEUR-WS.org (2021)"},{"key":"4_CR11","unstructured":"Calvanese, D., Montali, M., Lobo, J.: Verification of fixed-topology declarative distributed systems with external data. In: Proceedings of AMW-2018.,CEUR, ceur-ws.org, vol. 2100 (2018)"},{"key":"4_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"340","DOI":"10.1007\/978-3-540-85361-9_28","volume-title":"CONCUR 2008 - Concurrency Theory","author":"P Chambart","year":"2008","unstructured":"Chambart, P., Schnoebelen, P.: Mixing lossy and perfect fifo channels. In: van Breugel, F., Chechik, M. (eds.) CONCUR 2008. LNCS, vol. 5201, pp. 340\u2013355. Springer, Heidelberg (2008). https:\/\/doi.org\/10.1007\/978-3-540-85361-9_28"},{"key":"4_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"117","DOI":"10.1007\/978-3-662-43613-4_8","volume-title":"Formal Techniques for Distributed Objects, Components, and Systems","author":"C Chen","year":"2014","unstructured":"Chen, C., Jia, L., Xu, H., Luo, C., Zhou, W., Loo, B.T.: A program logic for verifying secure routing protocols. In: \u00c1brah\u00e1m, E., Palamidessi, C. (eds.) FORTE 2014. LNCS, vol. 8461, pp. 117\u2013132. Springer, Heidelberg (2014). https:\/\/doi.org\/10.1007\/978-3-662-43613-4_8"},{"key":"4_CR14","doi-asserted-by":"crossref","unstructured":"Chen, C., Loh, L.K., Jia, L., Zhou, W., Loo, B.T.: Automated verification of safety properties of declarative networking programs. In: Proceedings of PPDP, pp. 79\u201390 (2015)","DOI":"10.1145\/2790449.2790516"},{"key":"4_CR15","doi-asserted-by":"publisher","unstructured":"Czerwinski, W., Lasota, S., Lazic, R., Leroux, J., Mazowiecki, F.: The reachability problem for petri nets is not elementary. J. ACM 68(1), 7:1\u20137:28 (2021). https:\/\/doi.org\/10.1145\/3422822","DOI":"10.1145\/3422822"},{"key":"4_CR16","doi-asserted-by":"publisher","unstructured":"Di Cosmo, F.: Verification of sometimes termination of lazy-bounded declarative distributed systems. CoRR arxiv:2308.10007 (2023). https:\/\/doi.org\/10.48550\/arXiv.2308.10007","DOI":"10.48550\/arXiv.2308.10007"},{"issue":"6","key":"4_CR17","doi-asserted-by":"publisher","first-page":"61","DOI":"10.1145\/2663340","volume":"58","author":"K Jensen","year":"2015","unstructured":"Jensen, K., Kristensen, L.M.: Colored petri nets: a graphical language for formal modeling and validation of concurrent systems. Commun. ACM 58(6), 61\u201370 (2015). https:\/\/doi.org\/10.1145\/2663340","journal-title":"Commun. ACM"},{"key":"4_CR18","doi-asserted-by":"publisher","unstructured":"Lazic, R., Schmitz, S.: The complexity of coverability in $$\\nu $$-petri nets. In: Grohe, M., Koskinen, E., Shankar, N. (eds.) Proceedings of the 31st Annual ACM\/IEEE Symposium on Logic in Computer Science, LICS \u201916, New York, NY, USA, 5\u20138 July 2016, pp. 467\u2013476. ACM (2016). https:\/\/doi.org\/10.1145\/2933575.2933593","DOI":"10.1145\/2933575.2933593"},{"key":"4_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"488","DOI":"10.1007\/978-3-642-15025-8_24","volume-title":"Fields of Logic and Computation","author":"V Lifschitz","year":"2010","unstructured":"Lifschitz, V.: Thirteen definitions of a stable model. In: Blass, A., Dershowitz, N., Reisig, W. (eds.) Fields of Logic and Computation. LNCS, vol. 6300, pp. 488\u2013503. Springer, Heidelberg (2010). https:\/\/doi.org\/10.1007\/978-3-642-15025-8_24"},{"key":"4_CR20","unstructured":"Lipton, R.: The reachability problem requires exponential space. Research Report 62. Department of Computer Science, Yale University (1976)"},{"issue":"11","key":"4_CR21","doi-asserted-by":"publisher","first-page":"87","DOI":"10.1145\/1592761.1592785","volume":"52","author":"BT Loo","year":"2009","unstructured":"Loo, B.T., et al.: Declarative networking. CACM 52(11), 87\u201395 (2009)","journal-title":"CACM"},{"key":"4_CR22","doi-asserted-by":"publisher","first-page":"815","DOI":"10.1017\/S1471068413000513","volume":"13","author":"J Ma","year":"2013","unstructured":"Ma, J., Le, F., Wood, D., Russo, A., Lobo, J.: A declarative approach to distributed computing: specification, execution and analysis. Theory Pract. Logic Program. 13, 815\u2013830 (2013)","journal-title":"Theory Pract. Logic Program."},{"issue":"4","key":"4_CR23","doi-asserted-by":"publisher","first-page":"541","DOI":"10.1109\/5.24143","volume":"77","author":"T Murata","year":"1989","unstructured":"Murata, T.: Petri nets: properties, analysis and applications. Proc. IEEE 77(4), 541\u2013580 (1989). https:\/\/doi.org\/10.1109\/5.24143","journal-title":"Proc. IEEE"},{"issue":"2","key":"4_CR24","first-page":"158","volume":"38","author":"V Nigam","year":"2012","unstructured":"Nigam, V., Jia, L., Loo, B.T., Scedrov, A.: Maintaining distributed logic programs incrementally. Comput. Lang. Syst. Struct. 38(2), 158\u2013180 (2012)","journal-title":"Comput. Lang. Syst. Struct."},{"key":"4_CR25","doi-asserted-by":"publisher","first-page":"223","DOI":"10.1016\/0304-3975(78)90036-1","volume":"6","author":"C Rackoff","year":"1978","unstructured":"Rackoff, C.: The covering and boundedness problems for vector addition systems. Theor. Comput. Sci. 6, 223\u2013231 (1978). https:\/\/doi.org\/10.1016\/0304-3975(78)90036-1","journal-title":"Theor. Comput. Sci."},{"issue":"4","key":"4_CR26","doi-asserted-by":"publisher","first-page":"440","DOI":"10.1145\/2043164.2018510","volume":"41","author":"Y Ren","year":"2011","unstructured":"Ren, Y., et al.: FSR: formal analysis and implementation toolkit for safe inter-domain routing. Comput. Commun. Rev. 41(4), 440\u2013441 (2011)","journal-title":"Comput. Commun. Rev."},{"issue":"34","key":"4_CR27","doi-asserted-by":"publisher","first-page":"4439","DOI":"10.1016\/j.tcs.2011.05.007","volume":"412","author":"F Rosa-Velardo","year":"2011","unstructured":"Rosa-Velardo, F., de Frutos-Escrig, D.: Decidability and complexity of petri nets with unordered data. Theor. Comput. Sci. 412(34), 4439\u20134451 (2011). https:\/\/doi.org\/10.1016\/j.tcs.2011.05.007","journal-title":"Theor. Comput. Sci."},{"key":"4_CR28","doi-asserted-by":"crossref","unstructured":"Zaychik Moffitt, V., Stoyanovich, J., Abiteboul, S., Miklau, G.: Collaborative access control in WebdamLog. In: Proceedings of ACM SIGMOD, pp. 197\u2013211. ACM (2015)","DOI":"10.1145\/2723372.2749433"},{"issue":"2","key":"4_CR29","first-page":"49","volume":"6","author":"W Zhou","year":"2012","unstructured":"Zhou, W., et al.: Distributed time-aware provenance. PVLDB 6(2), 49\u201360 (2012)","journal-title":"PVLDB"}],"container-title":["Lecture Notes in Computer Science","Selected Reflections in Language, Logic, and Information"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-50628-4_4","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,12,27]],"date-time":"2023-12-27T18:02:54Z","timestamp":1703700174000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-50628-4_4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,12,28]]},"ISBN":["9783031506277","9783031506284"],"references-count":29,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-50628-4_4","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2023,12,28]]},"assertion":[{"value":"28 December 2023","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"ESSLLI","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"European Summer School in Logic, Language and Information","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Riga","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Latvia","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":"5 August 2019","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"16 August 2019","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"31","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"esslli2023","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/www.df.lu.lv\/en\/research\/conferences\/esslli-2019\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Two rounds of review: first double bline, then single blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"EasyChair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"81","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"13","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"0","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"16% - 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 (provided by the conference organizers)"}},{"value":"3+3","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"2","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}