Turing machines, transition systems, and interaction

Information and Computation

Volumn 194, Issue 2 SPEC. ISS., 2004, Pages 101-128

  Goldin, Dina Q ^a   Smolka, Scott A ^b   Attie, Paul C ^c   Sonderegger, Elaine L ^a  

^a UNIVERSITY OF CONNECTICUT   (United States)

^b Stony Brook University   (United States)

^c NORTHEASTERN UNIVERSITY   (United States)

Author keywords

Interactive transition system; Models of interactive computation; Persistent stream language; Persistent Turing machine; Sequential interactive computation

Indexed keywords

ALGORITHMS; COMPUTATIONAL METHODS; DATABASE SYSTEMS; FAULT TOLERANT COMPUTER SYSTEMS; INTERACTIVE COMPUTER SYSTEMS; PARALLEL PROCESSING SYSTEMS; SEMANTICS; STUDENTS;

INTERACTIVE TRANSITION SYSTEMS; MODELS OF INTERACTIVE COMPUTATION; PERSISTENT STREAM LANGUAGES; PERSISTENT TURING MACHINES; SEQUENTIAL INTERACTIVE COMPUTATION;

TURING MACHINES;

EID: 6344291533     PISSN: 08905401     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.ic.2004.07.002     Document Type: Article

References (59)

1. D. Goldin, S. Smolka, P. Wegner, Turing machines, transition systems, and interaction, Electronic Notes in Theoretical Computer Science 52, Elsevier, 2002.
2. R. Milner, Elements of interaction: Turing award lecture, Commun. ACM 36 (1) (1993) 78-89.
3. J. van Leeuwen, J. Wiedermann, The Turing machine paradigm in contemporary computing, in: B. Enquist, W. Schmidt (Eds.), Mathematics Unlimited - 2001 and Beyond, LNCS, Springer, Berlin, 2000.
4. P. Wegner, Why interaction is more powerful than algorithms, Commun. ACM 40 (5), May 1997.
5. P. Wegner, Interactive foundations of computing, Theoret. Comput. Sci. 192, February 1998.
6. G. Boudol, Notes on algebraic calculi of processes, in: K. Apt (Ed.), Logics and Models of Concurrent Systems, LNCS, Springer, Berlin, 1985, pp. 261-303.
7. R. de Simone, Higher-level synchronizing devices in MEIJE-SCCS, Theoret. Comput. Sci. 37 (1985) 245-267.
8. J. Baeten, J. Bergstra, J. Klop, On the consistency of Koomen's fair abstraction rule, Theoret. Comput. Sci. 51 (1/2) (1987) 129-176.
9. B.S. Bloom, S. Istrail, A.R. Meyer, Bisimulation can't be traced, in: Proc. 15th ACM Symposium on Principles of Programming Languages, 1988.
10. P. Darondeau, Concurrency and computability, in: I. Guessarian (Ed.), Semantics of Systems of Concurrent Processes, Proc. LITP Spring School on Theoretical Computer Science, LNCS 469, Springer, Berlin, La Roche Posay, France, 1990.
11. F.W. Vaandrager, Expressiveness results for process algebras, Tech. Rep. CS-R9301, Centrum voor Wiskunde en Informatica, Amsterdam, 1993.
12. S.D. Brookes, A.W. Roscoe, An improved failures model for communicating sequential processes, in: Proc. NSF-SERC Seminar on Concurrency, Springer, Berlin, 1985.
13. J. Hopcroft, R. Motwani, J. Ullman, Introduction to Automata Theory, Languages, and Computation, second ed., Addison-Wesley, Boston, 2001.
14. A. Pnueli, M. Shalev, What is in a step: on the semantics of Statecharts, in: Theoretical Aspects of Computer Software, No. 526 in Lecture Notes in Computer Science, 1991, pp. 244-264.
15. J. Barwise, L. Moss, Vicious circles, CSLI Lecture Notes #60, Cambridge University Press, Cambridge, 1996.
16. L. Lamport, Proving the correctness of multiprocess programs, IEEE Transactions on Software Engineering SE-3 (2) (1977) 125-143.
17. B. Alpern, F. Schneider, Recognizing safety and liveness, Distributed Comput. 2 (3) (1987) 117-126.
18. N. Lynch, F. Vaandrager, Forward and backward simulations - Part I: Untimed systems, Inform. Comput. 121 (2) (1995) 214-233.
19. E.W. Dijkstra, A Discipline of Programming, Prentice-Hall, Engle-wood Cliffs, NJ, 1976.
20. M. Prasse, P. Rittgen, Why Church's thesis still holds: some notes on Peter Wegner's tracts on interaction and computability, Comput. J. 41 (6) (1998) 357-362.
21. A.M. Turing, On computable numbers with an application to the Entscheidungsproblem, in: Proceedings of the London Math Society, vol. 2 (4), 1936, pp. 230-265, reprinted in Martin Davis, Ed., The Undecidable, Raven, New York, 1965, pp. 116-151.
22. A.M. Turing, On computable numbers with an application to the Entscheidungsproblem, in: Proceedings of the London Math Society, vol. 2 (4), 1936, pp. 230-265, reprinted in Martin Davis, Ed., The Undecidable, Raven, New York, 1965, pp. 116-151.
23. C. Papadimitriou, Computational Complexity, Addison-Wesley, Reading, MA, 1994.
24. D. Goldin, S. Srinivasa, B. Thalheim, Information systems=databases + interaction: towards principles of information system design, in: Proc. ER 2000, Salt Lake City, Utah, 2000.
25. E. Eberbach, D. Goldin, P. Wegner, Turing's ideas and models of computation, in: C. Teuscher (Ed.), Alan Turing: Life and Legacy of a Great Thinker, Springer, Berlin, 2004.
26. P. Wegner, D. Goldin, Coinductive models of finite computing agents, Electronic Notes in Theoretical Computer Science 19, Elsevier, 2000.
27. S.J. Russell, P. Norvig, Artificial Intelligence: A Modern Approach, Prentice-Hall, Upper Saddle River, NJ, 1995.
28. Y.-J. Chiang, R. Tamassia, Dynamic algorithms in computational geometry, in Proceedings of the IEEE, Special Issue on Computational Geometry, vol. 80 (9), 1992, pp. 362-381.
29. S. Albers, Online algorithms, in: Goldin et al. [57], forthcoming.
30. D. Goldin, P. Wegner, Persistence as a form of interaction, Brown University Tech. Rep. CS-98-07, July 1998.
31. D. Goldin, Persistent turing machines as a model of interactive computation, in: K.-D. Schewe, B. Thalheim (Eds.), Foundations of Information and Knowledge Systems, First International Symposium, LNCS 1762, Springer, Berlin, 2000, pp. 116-135.
32. G. Kahn, D.B. MacQueen, Coroutines and networks of parallel processes, in: Proceedings of the IFIP Congress 77, North-Holland, 1977.
33. P. Panangaden, E.W. Stark, Computations, residuals, and the power of indeterminancy, in: Proceedings of the 15th ICALP, Lecture Notes in Computer Science, vol. 317, Springer-Barlin, 1988, pp. 439-454.
34. A.M. Rabinovich, B.A. Trakhtenbrot, Communication among relations, in: Paterson [58], pp. 294-307.
35. P. Panangaden, V. Shanbhogue, E.W. Stark, Stability and sequentially in dataflow networks, in: Paterson [58], pp. 308-321.
36. G. Kahn, G. Plotkin, Concrete domains, Theoret. Comput. Sci. 121 (1-2) (1993) 187-277.
37. A. Bucciarelli, T. Ehrhard, Sequentiality in an extensional framework, Inform. Comput. 110 (2) (1994) 265-296.
38. R. Milner, Communication and Concurrency, International Series in Computer Science, Prentice Hall, 1989.
39. R. Milner, J. Parrow, D. Walker, A calculus of mobile processes, Parts I and II, Inform. Comput. 100 (1992) 1-77.
40. D. Harel, Statecharts: a visual formalism for complex systems, Sci. Comput. Program. 8 (1987) 231-274.
41. G. Berry, G. Gonthier, The ESTEREL synchronous programming language: design, semantics, implementation, Sci. Comput. Program. 19 (1992) 87-152.
42. J. Esparza, D. Hansel, P. Rossmanith, S. Schwoon, Efficient algorithms for model checking pushdown systems, in: Proc. CAV'2000, LNCS 1855, Springer, Berlin, 2000, pp. 232-247.
43. O. Burkart, D. Caucal, F. Moller, B. Steffen, Verification on infinite structures, in: Handbook of Process Algebra, Elsevier, Amsterdam, 2001.
44. S. Abramsky, Concurrent interaction games, in: J. Davies, A.W. Roscoe, J. Woodcock (Eds.), Millenial Perspectives in Computer Science, Pal-grave, 2000, pp. 1-12.
45. V. Saraswat, M. Rinard, Concurrent constraint programming, in: Proceedings of the 17th Annual ACM Symposium on Principles of Programming Languages, San Francisco, CA, 1990, pp. 232-245.
46. Z. Manna, A. Pnueli, The Temporal Logic of Reactive and Concurrent Systems, Springer, Berlin, Heidelberg, New York, 1992.
47. R. Alur, T.A. Henzinger, Reactive modules, Formal Methods System Design 15 (1999) 7-48.
48. N.A. Lynch, Distributed Algorithms, Morgan Kaufmann, 1996.
49. J. van Leeuwen, J. Wiedermann, A computational model of interaction in embedded systems, Tech. Rep. UU-CS-02-2001, Department of Computer Science, Utrecht University, 2001.
50. S. Kosub, Some remarks towards dynamic analysis of computation, Manuscript, Institut fur Informatik, Julius Maximilians Universitat, Wurzburg, March 1998.
51. S. Kosub, Persistent computations, Tech. Rep. 217, December 1998.
52. M.J. Fischer, L.J. Stockmeyer, East on-line integer multiplication, J. Comput. System Sci. 9 (3) (1974) 317-331.
53. O. Goldreich, Foundations of Cryptography, vol. I, Cambridge University Press, Cambridge, 2001.
54. B. Ekdahl, Interactive computing does not supersede Church's thesis, in: Proceedings of the 17th Confernce on International Association of Management, 1999, pp. 261-265.
55. D. Keil, D. Goldin, Modeling indirect interaction in open computational systems, in: WETICE 2003, IEEE Press, 2003, pp. 371-376.
56. D. Goldin, D. Keil, Toward domain-independent formalization of indirect interaction, in: WETICE 2004, IEEE Press.
57. M. Broy, Interactive computation: the new paradigm, in: Goldin et al. [57], forthcoming.
58. D. Goldin, S. Smolka, P. Wegner (Eds.), Interaction: A New Computational Paradigm, Springer, Heidelberg, Germany, 2005, forthcoming.
59. M. Paterson (Ed.), Automata, Languages and Programming (ICALP '90), vol. 443 of Lecture Notes in Computer Science, Springer, Berlin, Warwick, England, 1990.