License: Creative Commons Attribution 4.0 International license (CC BY 4.0)
When quoting this document, please refer to the following
DOI: 10.4230/DagSemProc.08271.1
URN: urn:nbn:de:0030-drops-16555
URL: http://dagstuhl.sunsite.rwth-aachen.de/volltexte/2008/1655/
Go to the corresponding Portal |
Hertling, Peter ;
Selivanov, Victor ;
Thomas, Wolfgang ;
Wadge, William W. ;
Wagner, Klaus
08271 Abstracts Collection -- Topological and Game-Theoretic Aspects of Infinite Computations
Abstract
From June 29, 2008, to July 4, 2008, the Dagstuhl Seminar 08271 ``Topological and Game-Theoretic Aspects of Infinite Computations'' was held in the International Conference and Research Center (IBFI), Schloss Dagstuhl. During the seminar, many participants presented their current research, and ongoing work and open problems were discussed. Abstracts of the presentations given during the seminar as well as abstracts of seminar results and ideas are put together in this paper. The first section describes the seminar topics and goals in general. Links to extended abstracts or full papers are provided, if available.
BibTeX - Entry
@InProceedings{hertling_et_al:DagSemProc.08271.1,
author = {Hertling, Peter and Selivanov, Victor and Thomas, Wolfgang and Wadge, William W. and Wagner, Klaus},
title = {{08271 Abstracts Collection – Topological and Game-Theoretic Aspects of Infinite Computations}},
booktitle = {Topological and Game-Theoretic Aspects of Infinite Computations},
pages = {1--17},
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/1655},
URN = {urn:nbn:de:0030-drops-16555},
doi = {10.4230/DagSemProc.08271.1},
annote = {Keywords: Automata theory, computability in analysis, dataflow computation, hierarchies, infinite computations, infinite games, reactive systems, specification and verification, topological complexity, Wadge reducibility}
}
Keywords: |
|
Automata theory, computability in analysis, dataflow computation, hierarchies, infinite computations, infinite games, reactive systems, specification |
Freie Schlagwörter (englisch): |
|
and verification, topological complexity, Wadge reducibility |
Collection: |
|
08271 - Topological and Game-Theoretic Aspects of Infinite Computations |
Issue Date: |
|
2008 |
Date of publication: |
|
05.11.2008 |