References

  1. Luca Aceto & Matthew Hennessy (1992): Termination, deadlock, and divergence. Journal of the ACM (JACM) 39(1), pp. 147–187, doi:10.1145/147508.147527.
  2. Jos Baeten, Twan Basten & Michel Reniers (2010): Process algebra: equational theories of communicating processes. Cambridge Tracts in Theoretical Computer Science 50. Cambridge University Press, doi:10.1017/CBO9781139195003.
  3. Jos Baeten, Jan Bergstra & Jan Klop (1993): Decidability of bisimulation equivalence for processes generating context-free languages. J. ACM 40(3), pp. 653–682, doi:10.1145/174130.174141.
  4. Jos Baeten, Pieter Cuijpers & Paul van Tilburg (2008): A context-free process as a pushdown automaton. In: International Conference on Concurrency Theory. Springer, pp. 98–113, doi:10.1007/978-3-540-85361-9_11.
  5. Jos Baeten, Bas Luttik & Paul van Tilburg (2013): Reactive Turing Machines. Inform. Comput. 231, pp. 143–166, doi:10.1016/j.ic.2013.08.010.
  6. Jos Baeten, Bas Luttik & Fei Yang (2017): Sequential composition in the presence of intermediate termination. CoRR abs/1706.08401. Available at http://arxiv.org/abs/1706.08401.
  7. Jos C. M. Baeten, Pieter J. L. Cuijpers, Bas Luttik & P. J. A. van Tilburg (2009): A process-theoretic look at automata. In: Farhad Arbab & Marjan Sirjani: Fundamentals of Software Engineering, Third IPM International Conference, FSEN 2009, Kish Island, Iran, April 15-17, 2009, Revised Selected Papers, Lecture Notes in Computer Science 5961. Springer, pp. 1–33, doi:10.1007/978-3-642-11623-0_1.
  8. Jos C. M. Baeten, Bas Luttik, Tim Muller & Paul van Tilburg (2016): Expressiveness modulo bisimilarity of regular expressions with parallel composition. Mathematical Structures in Computer Science 26, pp. 933–968, doi:10.1017/S0960129514000309.
  9. Jos C. M. Baeten, Bas Luttik & Paul van Tilburg (2011): Computations and interaction. In: Raja Natarajan & Adegboyega K. Ojo: ICDCIT, Lecture Notes in Computer Science 6536. Springer, pp. 35–54, doi:10.1007/978-3-642-19056-8_3.
  10. Jos C. M. Baeten, Bas Luttik & Paul van Tilburg (2012): Turing Meets Milner. In: Maciej Koutny & Irek Ulidowski: CONCUR, Lecture Notes in Computer Science 7454. Springer, pp. 1–20, doi:10.1007/978-3-642-32940-1_1.
  11. Jan Bergstra, Inge Bethke & Alban Ponse (1994): Process algebra with iteration and nesting. The Computer Journal 37(4), pp. 243–258, doi:10.1093/comjnl/37.4.243.
  12. Jan Bergstra & Alban Ponse (2001): Non-regular iterators in process algebra. Theoretical Computer Science 269(1), pp. 203–229, doi:10.1016/S0304-3975(00)00413-8.
  13. Bard Bloom (1994): When is partial trace equivalence adequate?. Formal Aspects of Computing 6(3), pp. 317–338, doi:10.1007/BF01215409.
  14. Wan Fokkink, Rob van Glabbeek & Bas Luttik (2017): Divide and congruence III: stability & divergence. In: Proceedings 28th International Conference on Concurrency Theory (CONCUR 2017), Leibniz International Proceedings in Informatics (LIPIcs) 85, pp. 11:1–11:15.
  15. Rob van Glabbeek, Bas Luttik & Nikola Trčka (2009): Branching bisimilarity with explicit divergence. Fundamenta Informaticae 93(4), pp. 371–392, doi:10.3233/FI-2009-109.
  16. Rob J. van Glabbeek (1993): The linear time - branching time spectrum II. In: Eike Best: CONCUR '93, 4th International Conference on Concurrency Theory, Hildesheim, Germany, August 23-26, 1993, Proceedings, Lecture Notes in Computer Science 715. Springer, pp. 66–81, doi:10.1007/3-540-57208-2_6.
  17. Rob J. van Glabbeek (2004): The meaning of negative premises in transition system specifications II. J. Log. Algebr. Program. 60-61, pp. 229–258, doi:10.1016/j.jlap.2004.03.007.
  18. Rob J. van Glabbeek, Bas Luttik & Nikola Trčka (2009): Computation Tree Logic with deadlock detection. Logical Methods in Computer Science 5(4), doi:10.2168/LMCS-5(4:5)2009.
  19. Bas Luttik & Fei Yang (2015): Executable behaviour and the π-calculus (extended abstract). In: Sophia Knight, Ivan Lanese, Alberto Lluch-Lafuente & Hugo Torres Vieira: Proceedings 8th Interaction and Concurrency Experience, ICE 2015, Grenoble, France, 4-5th June 2015., EPTCS 189, pp. 37–52, doi:10.4204/EPTCS.189.5.
  20. Bas Luttik & Fei Yang (2016): On the executability of interactive computation. In: Arnold Beckmann, Laurent Bienvenu & Natasa Jonoska: Pursuit of the Universal - 12th Conference on Computability in Europe, CiE 2016, Paris, France, June 27 - July 1, 2016, Proceedings, Lecture Notes in Computer Science 9709. Springer, pp. 312–322, doi:10.1007/978-3-319-40189-8_32.
  21. Robin Milner (1989): Communication and concurrency. PHI Series in computer science. Prentice Hall.
  22. Faron Moller (1996): Infinite results. In: Ugo Montanari & Vladimiro Sassone: CONCUR '96, Concurrency Theory, 7th International Conference, Pisa, Italy, August 26-29, 1996, Proceedings, Lecture Notes in Computer Science 1119. Springer, pp. 195–216, doi:10.1007/3-540-61604-7_56.
  23. David Park (1981): Concurrency and automata on infinite sequences. In: P. Deussen: Theoretical Computer Science, Lectures Notes in Computer Science 104. Springer, pp. 167–183, doi:10.1007/BFb0017309.
  24. Alan Turing (1937): On Computable Numbers, with an Application to the Entscheidungsproblem. Proceedings of the London Mathematical Society s2-42(1), pp. 230–265, doi:10.1112/plms/s2-42.1.230.
Comments and questions to: eptcs@eptcs.org
For website issues: webmaster@eptcs.org