Skip to main content
SpringerLink
Log in
Book cover

International Conference on Concurrency Theory

CONCUR 2012: CONCUR 2012 – Concurrency Theory pp 1–20Cite as

Turing Meets Milner

  • Conference paper

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 7454))

Abstract

We enhance the notion of a computation of the classical theory of computing with the notion of interaction from concurrency theory. In this way, we enhance a Turing machine as a model of computation to a Reactive Turing Machine that is an abstract model of a computer as it is used nowadays, always interacting with the user and the world.

This is a preview of subscription content, log in via an institution.

Chapter
USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Baeten, J.C.M., Basten, T., Reniers, M.A.: Process Algebra (Equational Theories of Communicating Processes). Cambridge Tracts in Theoretical Computer Science, vol. 50. Cambridge University Press (2009)

    Google Scholar 

  2. Baeten, J.C.M., Corradini, F., Grabmayer, C.A.: A characterization of regular expressions under bisimulation. Journal of the ACM 54(2), 6.1–6.28 (2007)

    Google Scholar 

  3. Baeten, J.C.M., Cuijpers, P.J.L., Luttik, B., van Tilburg, P.J.A.: A Process-Theoretic Look at Automata. In: Arbab, F., Sirjani, M. (eds.) FSEN 2009. LNCS, vol. 5961, pp. 1–33. Springer, Heidelberg (2010)

    Chapter  Google Scholar 

  4. Baeten, J.C.M., Cuijpers, P.J.L., van Tilburg, P.J.A.: A Context-Free Process as a Pushdown Automaton. In: van Breugel, F., Chechik, M. (eds.) CONCUR 2008. LNCS, vol. 5201, pp. 98–113. Springer, Heidelberg (2008)

    Chapter  Google Scholar 

  5. Baeten, J., Luttik, B., Muller, T., van Tilburg, P.: Expressiveness modulo bisimilarity of regular expressions with parallel composition (extended abstract). In: Fröschle, S., Valencia, F.D. (eds.) Proceedings EXPRESS 2010. EPTCS, vol. 41, pp. 1–15 (2010)

    Google Scholar 

  6. Baeten, J.C.M.: Models of Computation: Automata, Formal Languages and Communicating Processes. Technische Universiteit Eindhoven (2011), Syllabus 2IT15

    Google Scholar 

  7. Baeten, J.C.M., Luttik, B., van Tilburg, P.: Computations and Interaction. In: Natarajan, R., Ojo, A. (eds.) ICDCIT 2011. LNCS, vol. 6536, pp. 35–54. Springer, Heidelberg (2011)

    Chapter  Google Scholar 

  8. Baeten, J.C.M., Luttik, B., van Tilburg, P.: Reactive Turing Machines. In: Owe, O., Steffen, M., Telle, J.A. (eds.) FCT 2011. LNCS, vol. 6914, pp. 348–359. Springer, Heidelberg (2011)

    Chapter  Google Scholar 

  9. Basten, T.: Branching bisimilarity is an equivalence indeed! Information Processing Letters 58(3), 141–147 (1996)

    Article  MathSciNet  MATH  Google Scholar 

  10. Blass, A., Gurevich, Y.: Ordinary interactive small-step algorithms, ii. ACM Trans. Comput. Log. 8(3) (2007)

    Google Scholar 

  11. Blass, A., Gurevich, Y.: Ordinary interactive small-step algorithms, iii. ACM Trans. Comput. Log. 8(3) (2007)

    Google Scholar 

  12. Blass, A., Gurevich, Y., Rosenzweig, D., Rossman, B.: Interactive small-step algorithms i: Axiomatization. Logical Methods in Computer Science 3(4) (2007)

    Google Scholar 

  13. van Glabbeek, R.J.: What is Branching Time Semantics and why to use it? Bulletin of the EATCS 53, 190–198 (1994)

    Google Scholar 

  14. van Glabbeek, R.J., Luttik, B., Trčka, N.: Branching bisimilarity with explicit divergence. Fundamenta Informaticae 93(4), 371–392 (2009)

    MathSciNet  MATH  Google Scholar 

  15. van Glabbeek, R.J., Weijland, W.P.: Branching time and abstraction in bisimulation semantics. Journal of the ACM 43(3), 555–600 (1996)

    Article  MathSciNet  MATH  Google Scholar 

  16. Hoare, C.A.R.: Communicating Sequential Processes. Prentice Hall (1985)

    Google Scholar 

  17. Milner, R.: A Calculus of Communicating Systems. LNCS, vol. 92. Springer (1980)

    Google Scholar 

  18. Milner, R.: A complete inference system for a class of regular behaviours. Journal of Comput. System Sci. 28(3), 439–466 (1984)

    Article  MathSciNet  MATH  Google Scholar 

  19. Milner, R.: Elements of interaction. Communications of the ACM 36(1), 78–89 (1993)

    Article  Google Scholar 

  20. Moller, F.: Infinite Results. In: Montanari, U., Sassone, V. (eds.) CONCUR 1996. LNCS, vol. 1119, pp. 195–216. Springer, Heidelberg (1996)

    Chapter  Google Scholar 

  21. Park, D.M.R.: Concurrency and Automata on Infinite Sequences. In: Deussen, P. (ed.) GI-TCS 1981. LNCS, vol. 104, pp. 167–183. Springer, Heidelberg (1981)

    Chapter  Google Scholar 

  22. Plotkin, G.D.: A structural approach to operational semantics. J. Log. Algebr. Program. 60-61, 17–139 (2004)

    Article  MathSciNet  Google Scholar 

  23. van Tilburg, P.J.A.: From Computability to Executability (A Process-Theoretic View on Automata Theory). PhD thesis, Eindhoven University of Technology (2011)

    Google Scholar 

  24. Turing, A.M.: On computable numbers, with an application to the entscheidungsproblem. Proceedings of the London Mathematical Society 42(2), 230–265 (1936)

    MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Centrum Wiskunde & Informatica (CWI), P.O. Box 94079, 1090 GB, Amsterdam, The Netherlands

    Jos C. M. Baeten

  2. Division of Computer Science, Eindhoven University of Technology, P.O. Box 513, 5600 MB, Eindhoven, The Netherlands

    Jos C. M. Baeten, Bas Luttik & Paul van Tilburg

  3. Department of Computer Science, Vrije Universiteit Amsterdam, De Boelelaan 1081a, 1081 HV, Amsterdam, The Netherlands

    Bas Luttik

Authors
  1. Jos C. M. Baeten
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Bas Luttik
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Paul van Tilburg
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. School of Computing Science, Newcastle University, Claremont Tower, Claremont Road, NE1 7RU, Newcastle upon Tyne, UK

    Maciej Koutny

  2. Department of Computer Science, University of Leicester, Computer Science Building, University Road, LE1 7RH, Leicester, UK

    Irek Ulidowski

Rights and permissions

Reprints and permissions

Copyright information

© 2012 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Baeten, J.C.M., Luttik, B., van Tilburg, P. (2012). Turing Meets Milner. In: Koutny, M., Ulidowski, I. (eds) CONCUR 2012 – Concurrency Theory. CONCUR 2012. Lecture Notes in Computer Science, vol 7454. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-32940-1_1

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-32940-1_1

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-32939-5

  • Online ISBN: 978-3-642-32940-1

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation