References

  1. Patrick Blackburn & Johan van Benthem (2007): Modal logic: a semantic perspective. In: Patrick Blackburn, Johan van Benthem & Frank Wolter: Handbook of Modal Logic, Studies in Logic and Practical Reasoning 3. Elsevier, pp. 1–84, doi:10.1016/S1570-2464(07)80004-8.
  2. Patrick Blackburn, Maarten de Rijke & Yde Venema (2002): Modal logic. Cambridge Tracts in Theoretical Computer Science 53. Cambridge University Press, Cambridge, doi:10.1017/CBO9781107050884.
  3. Lauri Hella, Matti Järvisalo, Antti Kuusisto, Juhana Laurinharju, Tuomo Lempiäinen, Kerkko Luosto, Jukka Suomela & Jonni Virtema (2012): Weak models of distributed computing, with connections to modal logic. In: Darek Kowalski & Alessandro Panconesi: ACM Symposium on Principles of Distributed Computing, PODC '12, Funchal, Madeira, Portugal, July 16-18, 2012. ACM, pp. 185–194, doi:10.1145/2332432.2332466.
  4. Lauri Hella, Matti Järvisalo, Antti Kuusisto, Juhana Laurinharju, Tuomo Lempiäinen, Kerkko Luosto, Jukka Suomela & Jonni Virtema (2015): Weak models of distributed computing, with connections to modal logic. Distributed Computing 28(1), pp. 31–53, doi:10.1007/s00446-013-0202-3. Available at https://arxiv.org/abs/1205.2051.
  5. Neil Immerman (1999): Descriptive complexity. Graduate texts in computer science. Springer, doi:10.1007/978-1-4612-0539-5.
  6. Antti Kuusisto (2013): Modal Logic and Distributed Message Passing Automata. In: Simona Ronchi Della Rocca: Computer Science Logic 2013 (CSL 2013), CSL 2013, September 2-5, 2013, Torino, Italy, LIPIcs 23. Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik, pp. 452–468, doi:10.4230/LIPIcs.CSL.2013.452.
  7. Antti Kuusisto (2014): Infinite Networks, Halting and Local Algorithms. In: Adriano Peron & Carla Piazza: Proceedings Fifth International Symposium on Games, Automata, Logics and Formal Verification, GandALF 2014, Verona, Italy, September 10-12, 2014., EPTCS 161, pp. 147–160, doi:10.4204/EPTCS.161.14.
  8. Christof Löding (2012): Basics on Tree Automata. In: Deepak D'Souza & Priti Shankar: Modern Applications of Automata Theory, IISc Research Monographs Series 2. World Scientific, pp. 79–109, doi:10.1142/9789814271059_0003.
  9. Fabian Reiter (2015): Distributed Graph Automata. In: 30th Annual ACM/IEEE Symposium on Logic in Computer Science, LICS 2015, Kyoto, Japan, July 6-10, 2015. IEEE Computer Society, pp. 192–201, doi:10.1109/LICS.2015.27. Available at https://arxiv.org/abs/1408.3030.
  10. Fabian Reiter (2017): Asynchronous Distributed Automata: A Characterization of the Modal Mu-Fragment. In: Ioannis Chatzigiannakis, Piotr Indyk, Fabian Kuhn & Anca Muscholl: 44th International Colloquium on Automata, Languages, and Programming, ICALP 2017, July 10-14, 2017, Warsaw, Poland, LIPIcs 80. Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik, pp. 100:1–100:14, doi:10.4230/LIPIcs.ICALP.2017.100. Available at http://arxiv.org/abs/1611.08554.
  11. Jukka Suomela (2013): Survey of local algorithms. ACM Comput. Surv. 45(2), pp. 24:1–24:40, doi:10.1145/2431211.2431223.

Comments and questions to: eptcs@eptcs.org
For website issues: webmaster@eptcs.org