License
When quoting this document, please refer to the following
DOI: 10.4230/DagSemProc.08271.2
URN: urn:nbn:de:0030-drops-16499
URL: https://drops.dagstuhl.de/opus/volltexte/2008/1649/
Go to the corresponding Portal


Hertling, Peter ; Selivanov, Victor ; Thomas, Wolfgang ; Wadge, William W. ; Wagner, Klaus

08271 Executive Summary -- Topological and Game-Theoretic Aspects of Infinite Computations

pdf-format:
08271.SWM.Paper.1649.pdf (0.1 MB)


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.


BibTeX - Entry

@InProceedings{hertling_et_al:DagSemProc.08271.2,
  author =	{Hertling, Peter and Selivanov, Victor and Thomas, Wolfgang and Wadge, William W. and Wagner, Klaus},
  title =	{{08271 Executive Summary – Topological and Game-Theoretic Aspects of Infinite Computations}},
  booktitle =	{Topological and Game-Theoretic Aspects of Infinite Computations},
  pages =	{1--5},
  series =	{Dagstuhl Seminar Proceedings (DagSemProc)},
  ISSN =	{1862-4405},
  year =	{2008},
  volume =	{8271},
  editor =	{Peter Hertling and Victor Selivanov and Wolfgang Thomas and William W. Wadge and Klaus Wagner},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/opus/volltexte/2008/1649},
  URN =		{urn:nbn:de:0030-drops-16499},
  doi =		{10.4230/DagSemProc.08271.2},
  annote =	{Keywords: Automata theory, computability in analysis, dataflow computation, hierarchies, infinite computations, infinite games, reactive systems, specification}
}

Keywords: Automata theory, computability in analysis, dataflow computation, hierarchies, infinite computations, infinite games, reactive systems, specification
Collection: 08271 - Topological and Game-Theoretic Aspects of Infinite Computations
Issue Date: 2008
Date of publication: 05.11.2008


DROPS-Home | Fulltext Search | Imprint | Privacy Published by LZI