References

  1. A. Carayol & S. Wöhrle (2003): The Caucal Hierarchy of Infinite Graphs in Terms of Logic and Higher-Order Pushdown Automata. In: FST TCS 2003: Foundations of Software Technology and Theoretical Computer Science, 23rd Conference, Mumbai, India, December 15-17, 2003, Proceedings, pp. 112–123, doi:10.1007/978-3-540-24597-1_10.
  2. D. Caucal (1990): On the Regular Structure of Prefix Rewriting. In: CAAP '90, 15th Colloquium on Trees in Algebra and Programming, Copenhagen, Denmark, May 15-18, 1990, Proceedings, pp. 87–102, doi:10.1007/3-540-52590-4_42.
  3. D. Caucal (2002): On Infinite Terms Having a Decidable Monadic Theory. In: Mathematical Foundations of Computer Science 2002, 27th International Symposium, MFCS 2002, Warsaw, Poland, August 26-30, 2002, Proceedings, pp. 165–176, doi:10.1007/3-540-45687-2_13.
  4. D. Caucal (2008): Deterministic graph grammars. In: Logic and Automata: History and Perspectives [in Honor of Wolfgang Thomas]., pp. 169–250, doi:10.5117/9789053565766.
  5. T. Colcombet & C. Löding (2007): Transforming structures by set interpretations. Logical Methods in Computer Science 3(2), doi:10.2168/LMCS-3(2:4)2007.
  6. M. Dauchet & S. Tison (1990): The Theory of Ground Rewrite Systems is Decidable. In: Proceedings of the Fifth Annual Symposium on Logic in Computer Science (LICS '90), Philadelphia, Pennsylvania, USA, June 4-7, 1990, pp. 242–248, doi:10.1109/LICS.1990.113750.
  7. H. Ebbinghaus, J. Flum & W. Thomas (1996): Mathematical Logic. Undergraduate Texts in Mathematics. Springer New York. Available at https://books.google.com/books?id=VYLA8m7cqYcC.
  8. B. R. Hodgson (1982): On Direct Products of Automaton Decidable Theories. Theor. Comput. Sci. 19, pp. 331–335, doi:10.1016/0304-3975(82)90042-1.
  9. K. Lodaya (2007): Petri Nets, Event Structures and Algebra. In: Formal Models, Languages and Applications [this volume commemorates the 75th birthday of Prof. Rani Siromoney]., pp. 246–259, doi:10.1142/9789812773036_0017.
  10. C. Löding (2003): Infinite Graphs Generated by Tree Rewriting. RWTH Aachen.
  11. P. Madhusudan (2003): Model-checking Trace Event Structures. In: 18th IEEE Symposium on Logic in Computer Science (LICS 2003), 22-25 June 2003, Ottawa, Canada, Proceedings, pp. 371–380, doi:10.1109/LICS.2003.1210077.
  12. S. Schulz (2010): First-Order Logic with Reachability Predicates on Infinite Systems. In: IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, FSTTCS 2010, December 15-18, 2010, Chennai, India, pp. 493–504, doi:10.4230/LIPIcs.FSTTCS.2010.493.
  13. M. Shields (1997): Asynchronous Transition Systems, pp. 183–189. Springer London, London, doi:10.1007/978-1-4471-0933-4_15.
  14. P. Thiagarajan (1996): Regular Trace Event Structures. BRICS Report Series 3(32), doi:10.7146/brics.v3i32.20012. Available at https://tidsskrift.dk/brics/article/view/20012.
  15. S. Wöhrle & W. Thomas (2004): Model Checking Synchronized Products of Infinite Transition Systems. In: 19th IEEE Symposium on Logic in Computer Science (LICS 2004), 14-17 July 2004, Turku, Finland, Proceedings, pp. 2–11, doi:10.1109/LICS.2004.1319595.
Comments and questions to: eptcs@eptcs.org
For website issues: webmaster@eptcs.org