DagSemProc.08271.2.pdf
- Filesize: 105 kB
- 5 pages
Document
08271 Executive Summary – Topological and Game-Theoretic Aspects of Infinite Computations
Authors
-
Part of:
Volume:
Dagstuhl Seminar Proceedings, Volume 8271
Series: Dagstuhl Seminar Proceedings (DagSemProc) - License:
Creative Commons Attribution 4.0 International license
- Publication Date: 2008-11-05
Cite AsGet BibTex
Peter Hertling, Victor Selivanov, Wolfgang Thomas, William W. Wadge, and Klaus Wagner. 08271 Executive Summary – Topological and Game-Theoretic Aspects of Infinite Computations. In Topological and Game-Theoretic Aspects of Infinite Computations. Dagstuhl Seminar Proceedings, Volume 8271, pp. 1-5, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2008)
https://doi.org/10.4230/DagSemProc.08271.2
https://doi.org/10.4230/DagSemProc.08271.2
Abstract
The theory of the infinite behaviour of continuously operating computing devices is of primary importance for several branches of theoretical and practical computer science. In particular, it is fundamental for the verification and synthesis of reactive systems like microprocessors or operating systems, for the understanding of dataflow computation, and for the development of adequate mathematical foundations for exact real computation. The seminar brought together researchers from many different disciplines who are working on theoretical or practical aspects of infinite computations. In this summary we describe the topics, the goals, and the contributions of the seminar.
Keywords
- Automata theory
- computability in analysis
- dataflow computation
- hierarchies
- infinite computations
- infinite games
- reactive systems
- specification
Metrics
- Access Statistics
-
Total Accesses (updated on a weekly basis)
0PDF Downloads