Abstract
We deal with the issue of realizability and computability of interactive interface behaviors as described in [1]. We treat the following aspects of interactive behaviors that are represented by relations between communication streams:
– Causality between input and output streams
– Realizability of single output histories for given input histories
– The role of non-realizable output in specific system contexts and for composition
– Relating non-realizable behaviors to state machines
– The concept of interactive computation and computability
Finally, we relate our results to classical notions of computability. The main goal of this paper is the characterization of a general concept of interactive interface behavior as basis for the extension and generalization of the notion of computability to interactive behaviors.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Broy, M., Stølen, K.: Specification and Development of Interactive Systems: Focus on Streams, Interfaces, and Refinement. Springer, Heidelberg (2001)
Broy, M.: A Theory of System Interaction: Components, Interfaces, and Services. In: Goldin, D., Smolka, S., Wegner, P. (eds.) The New Paradigm, pp. 41–96. Springer, Heidelberg (2006)
Darondeau, P.: Concurrency and Computability. In: Proceedings of the LITP Spring School on Theoretical Computer Science on Semantics of Systems of Concurrent Processes, La Roche Posay, France, November 1990, pp. 223–238 (1990)
Eberbach, E., Goldin, D., Wegner, P.: Turing’s Ideas and Models of Computation. In: Alan Turing: Life and Legacy of a Great Thinker, Springer, Heidelberg (2004)
Goldin, D., Smolka, S., Attie, P., Sonderegger, E.: Turing Machines, Transition Systems, and Interaction. Information & Computation Journal (2004)
Goldin, D.Q., Wegner, P.: The Church-Turing Thesis: Breaking the Myth. In: Cooper, S.B., Löwe, B., Torenvliet, L. (eds.) CiE 2005. LNCS, vol. 3526, pp. 152–168. Springer, Heidelberg (2005)
Japaridze, G.: Computability Logic: a Formal Theory of Interaction. In: Goldin, D., Smolka, S., Wegner, P. (eds.) The New Paradigm, pp. 183–226. Springer, Heidelberg (2006)
Milner, R.: Elements of Interaction: Turing Award Lecture. Communications of the ACM 36(1), 78–89 (1993)
Prasse, M., Rittgen, P.: Why Church’s Thesis still Holds: Some Notes on Peter Wegner’s Tracts on Interaction and Computability. Comput. J. 41(6), 357–362 (1998)
Wegner, P.: Why Interaction is More Powerful than Algorithms. Communications of the ACM (May 1997)
van Leeuwen, J., Wiedermann, J.: A Theory of Interactive Computation. In: The New Paradigm, pp. 119–142. Springer, Heidelberg (2006)
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 2007 Springer Berlin Heidelberg
About this paper
Cite this paper
Broy, M. (2007). Interaction and Realizability. In: van Leeuwen, J., Italiano, G.F., van der Hoek, W., Meinel, C., Sack, H., Plášil, F. (eds) SOFSEM 2007: Theory and Practice of Computer Science. SOFSEM 2007. Lecture Notes in Computer Science, vol 4362. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-69507-3_3
Download citation
DOI: https://doi.org/10.1007/978-3-540-69507-3_3
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-69506-6
Online ISBN: 978-3-540-69507-3
eBook Packages: Computer ScienceComputer Science (R0)