A theory of interactive computation

Interactive Computation: The New Paradigm

Volumn , Issue , 2006, Pages 119-142

  Van Leeuwen, Jan ^a   Wiedermann, Jiří ^b  

^a UTRECHT UNIVERSITY   (Netherlands)

^b INSTITUTE OF MATHEMATICS   (Czech Republic)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 38149060489     PISSN: None     EISSN: None     Source Type: Book    
DOI: 10.1007/3-540-34874-3_6     Document Type: Chapter

References (37)

1. M. Broy. A logical basis for modular software and systems engineering, in: B. Rovan (Ed.), SOFSEM'98: Theory and Practice of Informatics, Proc. 25th Conference on Current Trends, Lecture Notes in Computer Science, Vol. 1521, Springer-Verlag, Berlin, 1998, pp. 19-35.
2. R. S. Cohen, A. Y. Gold. ς-Computations on Turing machines, Theor. Comput. Sci. 6, 1978, pp. 1-23.
3. J. Engelfriet, H. J. Hoogeboom. X-automata on ς-words, Theor. Comput. Sci. 110, 1993, pp. 1-51.
4. D. Q. Goldin. Persistent Turing machines as a model of interactive computation, in: K-D. Schewe and B. Thalheim (Eds.), Foundations of Information and Knowledge Systems, Proc. First Int. Symposium (FoIKS 2000), Lecture Notes in Computer Science, vol. 1762, Springer-Verlag, Berlin, 2000, pp. 116-135.
5. D. Q. Goldin, S. A. Smolka, P. C. Attie, E. L. Sonderegger. Turing machines, transition systems, and interaction, Information and Computation 192, 2004, pp. 101-128.
6. D. Goldin, P. Wegner. Persistence as a form of interaction, Techn. Report CS-98-07, Dept. of Computer Science, Brown University, Providence, RI, 1998.
7. D. König. Sur les correspondances multivoques des ensembles, Fundam. Math. 8, 1926, pp. 114-134.
8. D. König. Uber eine Schlussweise aus dem endlichen ins Unendliche (Punktmengen. - Kartenfärben. - Verwantschaftsbeziehungen. - Schachspiel), Acta Litt. Sci. (Sectio Sci. Math.) 3, 1927, pp. 121-130.
9. S. Kosub. Persistent computations, Techn. Report No. 217, Institut für Informatik, Julius-Maximilians-Universität Würzburg, 1998.
10. L. H. Landweber. Decision problems for ς-automata, Math. Systems Theory 3, 1969, pp. 376-384.
11. Z. Manna, A. Pnueli. Models for reactivity, Acta Informatica 30, 1993, pp. 609-678.
12. R. Milner. A calculus of communicating systems, Lecture Notes in Computer Science, Vol. 92, Springer-Verlag, Berlin, 1980.
13. R. Milner. Elements of interaction, Comm. ACM 36:1, 1993, pp. 78-89.
14. D. Perrin, J-E. Pin. Infinite words: automata, semigroups, logic and games, Academic Press, New York, 2003.
15. A. Pnueli. Applications of temporal logic to the specification and verification of reactive systems: a survey of current trends, in: J. W. de Bakker, W.-P. de Roever and G. Rozenberg, Current Trends in Concurrency, Lecture Notes in Computer Science, Vol. 224, Springer-Verlag, Berlin, 1986, pp. 510-585.
16. A. Pnueli. Specification and development of reactive systems, in: H.-J. Kugler (Ed.), Information Processing 86, Proceedings IFIP 10th World Computer Congress, Elsevier Science Publishers (North-Holland), Amsterdam, 1986, pp. 845-858.
17. H. Rogers. Theory of recursive functions and effective computability, McGraw-Hill, New York, 1967.
18. G. Rozenberg, F. W. Vaandrager (Eds.). Lectures on embedded systems, Lecture Notes in Computer Science, Vol. 1494, Springer-Verlag, Berlin, 1998.
19. L. Sekanina, V. Drábek. Theory and applications of evolvable embedded systems, in: Proc. 11th IEEE Int. Conference and Workshop on the Engineering of Computer-Based Systems, IEEE press, Los Alamitos, 2004, pp. 186-193.
20. L. Staiger. ς-Languages, in: G. Rozenberg and A. Salomaa (Eds.), Handbook of Formal Languages, Vol. 3: Beyond Words, Chapter 6, Springer-Verlag, Berlin, 1997, pp. 339-387.
21. S. Stepney et al.. Journeys in non-classical computation I: A grand challenge for computing research, Int. J. Parallel, Emergent and Distributed Systems 20, 2005, pp. 5-19.
22. W. Thomas. Automata on infinite objects, in: J. van Leeuwen (Ed.), Handbook of Theoretical Computer Science, Vol. B: Models and Semantics, Elsevier Science Publishers, Amsterdam, 1990, pp. 135-191.
23. W. Thomas. Languages, automata, and logic, in: G. Rozenberg and A. Salomaa (Eds.), Handbook of Formal Languages, Vol. 3: Beyond Words, Chapter 7, Springer-Verlag, Berlin, 1997, pp. 389-455.
24. B. A. Trakhtenbrot. Automata and their interaction: definitional suggestions, in: G. Ciobanu and G. P?aun (Eds.), Fundamentals of Computation Theory, Proc. 12th International Symposium (FCT'99), Lecture Notes in Computer Science, Vol. 1684, Springer-Verlag, Berlin, 1999, pp. 54-89.
25. J. van Leeuwen, J. Wiedermann. On the power of interactive computing, in: J. van Leeuwen et al (Eds), Theoretical Computer Science - Exploring New Frontiers of Theoretical Computer Science, Proc. IFIP TCS 2000 Conference, Lecture Notes in Computer Science Vol. 1872, Springer-Verlag, Berlin, 2000, pp. 619-623.
26. J. van Leeuwen, J. Wiedermann. A computational model of interaction in embedded systems, Techn. Report UU-CS-2001-02, Dept of Computer Science, Utrecht University, 2001.
27. J. van Leeuwen, J. Wiedermann. On algorithms and interaction, in: M. Nielsen and B. Rovan (Eds), Mathematical Foundations of Computer Science 2000, 25th Int. Symposium (MFCS 2000), Lecture Notes in Computer Science Vol. 1893, Springer-Verlag, Berlin, 2000, pp. 99-112.
28. J. van Leeuwen, J. Wiedermann. The Turing machine paradigm in contemporary computing, in: B. Enquist and W. Schmidt (Eds), Mathematics Unlimited - 2001 and Beyond, Springer-Verlag, Berlin, 2001, pp. 1139-1155.
29. P. Verbaan, J. van Leeuwen, J. Wiedermann. Complexity of evolving interactive systems, in: J. Karhumaki et al. (Eds.), Theory is forever, Festschrift, Lecture Notes in Computer Science Vol. 3113, Springer-Verlag, Berlin, 2004, pp. 268-281.
30. K. Wagner, L. Staiger. Recursive ς-languages, in: M. Karpinsky (Ed.), Fun - damentals of Computation Theory, Proc. 1977 Int. FCT-Conference, Lecture Notes in Computer Science, Vol. 56, Springer-Verlag, Berlin, 1977, pp. 532-537.
31. P. Wegner. Interaction as a basis for empirical computer science, Comput. Surv. 27, 1995, pp. 45-48.
32. P. Wegner. Why interaction is more powerful than algorithms, Comm. ACM 40, 1997, pp. 80-91.
33. P. Wegner. Interactive foundations of computing, Theor. Comp. Sci. 192, 1998, pp. 315-351.
34. P. Wegner, D. Goldin. Co-inductive models of finite computing agents, in: B. Jacobs and J. Rutten (Eds.), CMCS'99-Coalgebraic Methods in Computer Science, TCS: Electronic Notes in Theoretical Computer Science, Vol. 19, Elsevier, 1999.
35. P. Wegner, D. Goldin. Interaction as a framework for modeling, in: P. Chen et al. (Eds.), Conceptual Modeling - Current Issues and Future Directions, Lecture Notes in Computer Science, Vol. 1565, Springer-Verlag, Berlin, 1999, pp. 243-257.
36. P. Wegner, D. Goldin. Computation beyond Turing machines, Comm. ACM 46, 2003, pp. 100-102.
37. G. Winskel. The formal semantics of programming languages: an introduction, The MIT Press, Cambridge (Mass.), 1993.