References

  1. Dana Angluin, James Aspnes, Zoë Diamadi, Michael J. Fischer & René Peralta (2006): Computation in networks of passively mobile finite-state sensors. Distributed Comput. 18(4), pp. 235–253. Available at https://doi.org/10.1007/s00446-005-0138-3.
  2. Dana Angluin, James Aspnes, David Eisenstat & Eric Ruppert (2007): The computational power of population protocols. Distributed Comput. 20(4), pp. 279–304. Available at https://doi.org/10.1007/s00446-007-0040-2.
  3. A. R. Balasubramanian & Chana Weil-Kennedy (2021): Reconfigurable Broadcast Networks and Asynchronous Shared-Memory Systems are Equivalent (Long Version). Available at https://arxiv.org/abs/2108.07510.
  4. Nathalie Bertrand & Paulin Fournier (2013): Parameterized Verification of Many Identical Probabilistic Timed Processes. In: IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, FSTTCS, pp. 501–513, doi:10.4230/LIPIcs.FSTTCS.2013.501.
  5. Nathalie Bertrand, Paulin Fournier & Arnaud Sangnier (2014): Playing with Probabilities in Reconfigurable Broadcast Networks. In: Foundations of Software Science and Computation Structures - 17th International Conference, FOSSACS, pp. 134–148, doi:10.1007/978-3-642-54830-7_9.
  6. Patricia Bouyer, Nicolas Markey, Mickael Randour, Arnaud Sangnier & Daniel Stan (2016): Reachability in Networks of Register Protocols under Stochastic Schedulers. In: Ioannis Chatzigiannakis, Michael Mitzenmacher, Yuval Rabani & Davide Sangiorgi: 43rd International Colloquium on Automata, Languages, and Programming, ICALP 2016, July 11-15, 2016, Rome, Italy, LIPIcs 55. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, pp. 106:1–106:14. Available at https://doi.org/10.4230/LIPIcs.ICALP.2016.106.
  7. Peter Chini, Roland Meyer & Prakash Saivasan (2019): Complexity of Liveness in Parameterized Systems. In: Arkadev Chattopadhyay & Paul Gastin: 39th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, FSTTCS 2019, December 11-13, 2019, Bombay, India, LIPIcs 150. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, pp. 37:1–37:15. Available at https://doi.org/10.4230/LIPIcs.FSTTCS.2019.37.
  8. Peter Chini, Roland Meyer & Prakash Saivasan (2019): Liveness in Broadcast Networks. In: Mohamed Faouzi Atig & Alexander A. Schwarzmann: Networked Systems - 7th International Conference, NETYS 2019, Marrakech, Morocco, June 19-21, 2019, Revised Selected Papers, Lecture Notes in Computer Science 11704. Springer, pp. 52–66. Available at https://doi.org/10.1007/978-3-030-31277-0_4.
  9. Peter Chini, Roland Meyer & Prakash Saivasan (2020): Fine-Grained Complexity of Safety Verification. J. Autom. Reason. 64(7), pp. 1419–1444. Available at https://doi.org/10.1007/s10817-020-09572-x.
  10. Giorgio Delzanno, Arnaud Sangnier & Riccardo Traverso (2013): Parameterized Verification of Broadcast Networks of Register Automata. In: Reachability Problems - 7th International Workshop, RP, pp. 109–121, doi:10.1007/978-3-642-41036-9_11.
  11. Giorgio Delzanno, Arnaud Sangnier, Riccardo Traverso & Gianluigi Zavattaro (2012): On the Complexity of Parameterized Reachability in Reconfigurable Broadcast Networks. In: Deepak D'Souza, Telikepalli Kavitha & Jaikumar Radhakrishnan: IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, FSTTCS 2012, December 15-17, 2012, Hyderabad, India, LIPIcs 18. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, pp. 289–300. Available at https://doi.org/10.4230/LIPIcs.FSTTCS.2012.289.
  12. Giorgio Delzanno, Arnaud Sangnier & Gianluigi Zavattaro (2010): Parameterized Verification of Ad Hoc Networks. In: Paul Gastin & François Laroussinie: CONCUR 2010 - Concurrency Theory, 21th International Conference, CONCUR 2010, Paris, France, August 31-September 3, 2010. Proceedings, Lecture Notes in Computer Science 6269. Springer, pp. 313–327. Available at https://doi.org/10.1007/978-3-642-15375-4_22.
  13. Antoine Durand-Gasselin, Javier Esparza, Pierre Ganty & Rupak Majumdar (2017): Model checking parameterized asynchronous shared-memory systems. Formal Methods Syst. Des. 50(2-3), pp. 140–167. Available at https://doi.org/10.1007/s10703-016-0258-3.
  14. Javier Esparza, Pierre Ganty & Rupak Majumdar (2016): Parameterized Verification of Asynchronous Shared-Memory Systems. J. ACM 63(1), pp. 10:1–10:48. Available at https://doi.org/10.1145/2842603.
  15. Javier Esparza, Pierre Ganty, Rupak Majumdar & Chana Weil-Kennedy (2018): Verification of Immediate Observation Population Protocols. In: CONCUR, LIPIcs 118. Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik, pp. 31:1–31:16. Available at https://doi.org/10.4230/LIPIcs.CONCUR.2018.31.
  16. Javier Esparza, Mikhail Raskin & Chana Weil-Kennedy (2019): Parameterized Analysis of Immediate Observation Petri Nets.. In: Lecture Notes in Computer Science 11522, pp. 365–385. Available at https://doi.org/10.1007/978-3-030-21571-2_20.
  17. Javier Esparza, Mikhail A. Raskin & Chana Weil-Kennedy (2019): Parameterized Analysis of Immediate Observation Petri Nets. In: Susanna Donatelli & Stefan Haar: Application and Theory of Petri Nets and Concurrency - 40th International Conference, PETRI NETS 2019, Aachen, Germany, June 23-28, 2019, Proceedings, Lecture Notes in Computer Science 11522. Springer, pp. 365–385. Available at https://doi.org/10.1007/978-3-030-21571-2_20.
  18. Marie Fortin, Anca Muscholl & Igor Walukiewicz (2017): Model-Checking Linear-Time Properties of Parametrized Asynchronous Shared-Memory Pushdown Systems. In: Rupak Majumdar & Viktor Kuncak: Computer Aided Verification - 29th International Conference, CAV 2017, Heidelberg, Germany, July 24-28, 2017, Proceedings, Part II, Lecture Notes in Computer Science 10427. Springer, pp. 155–175. Available at https://doi.org/10.1007/978-3-319-63390-9_9.
  19. Paulin Fournier (2015): Parameterized verification of networks of many identical processes. (Vérification paramétrée de réseaux composés d'une multitude de processus identiques). University of Rennes 1, France. Available at https://tel.archives-ouvertes.fr/tel-01355847.
  20. Salvatore La Torre, Anca Muscholl & Igor Walukiewicz (2015): Safety of Parametrized Asynchronous Shared-Memory Systems is Almost Always Decidable. In: Luca Aceto & David de Frutos-Escrig: 26th International Conference on Concurrency Theory, CONCUR 2015, Madrid, Spain, September 1.4, 2015, LIPIcs 42. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, pp. 72–84. Available at https://doi.org/10.4230/LIPIcs.CONCUR.2015.72.
Comments and questions to: eptcs@eptcs.org
For website issues: webmaster@eptcs.org