References

  1. J-P. Allouche & J. O. Shallit (2003): Automatic Sequences - Theory, Applications, Generalizations. Cambridge University Press, doi:10.1017/CBO9780511546563.
  2. D. Angluin (1980): Local and Global Properties in Networks of Processors (Extended Abstract). In: STOC, pp. 82–93, doi:10.1145/800141.804655.
  3. C. Areces & B. ten Cate (2006): Hybrid Logics. In: P. Blackburn, F. Wolter & J. van Benthem: Handbook of Modal Logics. Elsevier, pp. 821–868, doi:10.1016/S1570-2464(07)80017-6.
  4. P. Blackburn & J. van Benthem (2006): Modal logic: a Semantic Perspective. In: Frank Wolter Patrick Blackburn, Johan van Benthem: Handbook of Modal Logic. Elsevier, pp. 1–82, doi:10.1016/S1570-2464(07)80004-8.
  5. P. Blackburn, J. Benthem & F. Wolter (2006): Handbook of Modal Logic, Volume 3 (Studies in Logic and Practical Reasoning). Elsevier Science Inc., New York, NY, USA.
  6. P. Blackburn, M. de Rijke & Y. Venema (2001): Modal Logic. Cambridge University Press, New York, NY, USA, doi:10.1017/CBO9781107050884.
  7. H-D. Ebbinghaus, J. Flum & W. Thomas (1994): Mathematical logic. Undergraduate texts in mathematics. Springer, doi:10.1007/978-1-4757-2355-7.
  8. L. Hella, M. Järvisalo, A. Kuusisto, J. Laurinharju, T. Lempiäinen, K. Luosto, J. Suomela & J. Virtema (2012): Weak models of distributed computing, with connections to modal logic. In: PODC, pp. 185–194, doi:10.1145/2332432.2332466.
  9. L. Hella, M. Järvisalo, A. Kuusisto, J. Laurinharju, T. Lempiäinen, K. Luosto, J. Suomela & J. Virtema (2014): Weak Models of Distributed Computing, with Connections to Modal Logic Online first, doi:10.1007/s00446-013-0202-3.
  10. N. Immerman (1999): Descriptive complexity. Graduate texts in computer science. Springer, doi:10.1007/978-1-4612-0539-5.
  11. A. Kuusisto (2013): Modal logic and distributed message passing automata. In: CSL, pp. 452–468, doi:10.4230/LIPIcs.CSL.2013.452.
  12. L. Libkin (2004): Elements of Finite Model Theory. Springer, doi:10.1007/978-3-662-07003-1.
  13. J. Suomela (2013): Survey of local algorithms. ACM Comput. Surv. 45(2), pp. 24, doi:10.1145/2431211.2431223.

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