Verfügbarkeit: Parity games, separations, and the modal μ-calculus

Parity games, separations, and the modal μ-calculus:

Gespeichert in:

Bibliographische Detailangaben
1. Verfasser:	Dittmann, Christoph (VerfasserIn)
Format:	Abschlussarbeit Elektronisch E-Book
Sprache:	English
Veröffentlicht:	Berlin Universitätsverlag der TU Berlin 2017
Schriftenreihe:	Foundations of computing 9
Schlagworte:	Paritätsspiel My-Kalkül Hochschulschrift
Online-Zugang:	Inhaltsverzeichnis Volltext Volltext Volltext Inhaltsverzeichnis
Beschreibung:	1 Online-Ressource (x, 274 Seiten) Diagramme 21 cm
ISBN:	9783798328884
DOI:	10.14279/depositonce-5700

Internformat

MARC


LEADER	00000nmm a2200000 cb4500
001	BV044644911
003	DE-604
005	20181016
006	a m\|\|\| 00\|\|\|
007	cr\|uuu---uuuuu
008	171121s2017 gw \|\|\|\| o\|\|u\| \|\|\|\|\|\|eng d
016	7		\|a 1127244396 \|2 DE-101
020			\|a 9783798328884 \|9 978-3-7983-2888-4
024	7		\|a 10.14279/depositonce-5700 \|2 doi
035			\|a (OCoLC)1012698682
035			\|a (DE-599)DNB1127244396
040			\|a DE-604 \|b ger \|e rda
041	0		\|a eng
044			\|a gw \|c XA-DE-BE
049			\|a DE-634 \|a DE-83
082	0		\|a 511.3 \|2 22/ger
084			\|a ST 130 \|0 (DE-625)143588: \|2 rvk
084			\|a ST 620 \|0 (DE-625)143684: \|2 rvk
084			\|a 004 \|2 sdnb
100	1		\|a Dittmann, Christoph \|e Verfasser \|0 (DE-588)1159925909 \|4 aut
245	1	0	\|a Parity games, separations, and the modal μ-calculus \|c Christoph Dittmann
264		1	\|a Berlin \|b Universitätsverlag der TU Berlin \|c 2017
300			\|a 1 Online-Ressource (x, 274 Seiten) \|b Diagramme \|c 21 cm
336			\|b txt \|2 rdacontent
337			\|b c \|2 rdamedia
338			\|b cr \|2 rdacarrier
490	1		\|a Foundations of computing \|v 9
502			\|b Dissertation \|c Technische Universität Berlin \|d 2017
650	0	7	\|a Paritätsspiel \|0 (DE-588)1141802864 \|2 gnd \|9 rswk-swf
650	0	7	\|a My-Kalkül \|0 (DE-588)4530731-3 \|2 gnd \|9 rswk-swf
655		7	\|0 (DE-588)4113937-9 \|a Hochschulschrift \|2 gnd-content
689	0	0	\|a My-Kalkül \|0 (DE-588)4530731-3 \|D s
689	0	1	\|a Paritätsspiel \|0 (DE-588)1141802864 \|D s
689	0		\|5 DE-604
710	2		\|a Technische Universität Berlin \|b Universitätsbibliothek \|0 (DE-588)5053182-7 \|4 pbl
776	0	8	\|i Erscheint auch als \|n Druck-Ausgae \|z 978-3-7983-2887-7 \|w (DE-604)BV044946663
830		0	\|a Foundations of computing \|v 9 \|w (DE-604)BV044943050 \|9 9
856	4	2	\|m B:DE-101 \|q application/pdf \|u http://d-nb.info/1127244396/04 \|3 Inhaltsverzeichnis
856	4	0	\|u https://depositonce.tu-berlin.de/bitstream/11303/6135/3/dittmann_christoph.pdf \|3 Volltext
856	4	0	\|u https://depositonce.tu-berlin.de/handle/11303/6135 \|3 Volltext
856	4	0	\|u https://doi.org/10.14279/depositonce-5700 \|x Resolving-System \|z kostenfrei \|3 Volltext
856	4	2	\|m DNB Datenaustausch \|q application/pdf \|u http://bvbr.bib-bvb.de:8991/F?func=service&doc_library=BVB01&local_base=BVB01&doc_number=030042777&sequence=000001&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA \|3 Inhaltsverzeichnis
912			\|a ebook
999			\|a oai:aleph.bib-bvb.de:BVB01-030042777

Datensatz im Suchindex

_version_	1804178068715077632
adam_text	CONTENTS 1 INTRODUCTION 1 2 PRELIMINARIES 11 3 THE MODAL /X-CALCULUS AND PARITY GAMES 15 3.1 THE MODAL //-C ALCU LU S ........................................ 16 3.1.1 S Y N TAX ....................................................... 16 3.1.2 S EM ANTICS ................................................. 18 3.1.3 NEGATION NORMAL FORM ......................... 23 3.1.4 R ECU RSIO N ................................................. 26 3.1.5 E X A M P LE S ................................................. 28 3.1.6 BISIMULATION IN V A RIA N C E ......................... 31 3.1.7 SUBFORMULAS AND CLOSURE ...................... 34 3.1.8 FORMULA D E P TH ........................................ 38 3.2 PARITY G A M E S ....................................................... 47 3.2.1 D EFINITION ................................................. 47 3.2.2 POSITIONAL D E TE RM IN A C Y ......................... 50 3.2.3 ATTRACTOR SETS ........................................ 53 3.3 RELATION TO THE MODAL / C ALCULUS....................... 58 3.3.1 ANNOTATED F O RM U LA S............................... 59 3.3.2 MODEL-CHECKING G A M E ............................ 60 4 COMPUTATIONAL COMPLEXITY 71 4.1 THE COMPLEXITY OF PARITY G A M E S ...................... 71 4.1.1 GENERAL ALGORITHMS ............................... 74 4.1.2 ALGORITHMS ON RESTRICTED CLASSES .... 77 4.1.3 FIXED-PARAMETER T RA C TA B ILITY ............... 78 4.2 THE MODEL-CHECKING P RO B LE M ...................... 81 4.3 DIFFICULTY OF RESTRICTED C LA S S E S ......................... 83 4.3.1 HARDNESS ................................................. 84 4.3.2 PLANAR G R A P H S ........................................ 85 4.3.3 T REEW IDTH ................................................. 91 4.3.4 LOCALLY BOUNDED T REEW ID TH ................... 94 5 TYPES 99 5.1 A FEFERMAN-VAUGHT T H E O RE M ............................ 99 5.1.1 DIRECTED S EPARATIONS...................................101 5.2 PROOF OF THE MAIN T H E O RE M ...................................104 5.2.1 AN EASY G ASE............................................... 104 5.2.2 A SLIGHTLY MORE GENERAL G ASE ................... 106 5.2.3 PRIORITY T RACKING.........................................111 5.2.4 THE GENERAL GASE ......................................114 5.2.5 PARITY G A M E S............................................... 115 5.2.6 PROFILES AND T Y P E S ......................................116 5.2.7 DEFMABLE PROFILES.........................................126 5.2.8 A SMALL PARITY G A M E ................................132 5.2.9 FINISHING THE P RO O F......................................137 5.3 RUNNING TIME ........................................................ 140 5.3.1 UPPER B O U N D ............................................... 140 5.3.2 LOWER B O U N D ............................................... 145 5.4 FPT ALGORITHMS FOR MODEL CHECKING .... 147 5.4.1 WEAK SEPARATIONS ......................................147 5.4.2 KELLY-WIDTH ............................................... 152 5.4.3 D A G -W IDTH...................................................157 5.5 C ONCLUSIONS............................................................... 161 6 GRAPH OPERATIONS ON PARITY GAMES 163 6.1 P RELIM IN ARIES ........................................................... 164 6.1.1 BASIC D EFINITIONS.........................................164 6.1.2 HALF-SOLVING PARITY GAMES ........................166 6.1.3 RECOGNIZING WINNING R EGIONS ................... 169 6.2 THE JOIN OF TWO PARITY G A M E S ............................ 169 6.2.1 ADJOINING VERTICES BELONGING TO ONE PLAYER 171 6.2.2 JOINING TWO PARITY GAMES ........................180 6.3 PASTING OF PARITY G A M E S.........................................183 6.4 ADDING A SINGLE V ERTEX............................................187 6.5 C ONCLUSIONS .............................................................. 189 7 A FORMAL PROOF OF POSITIONAL DETERMINACY 191 7.1 B ACKGROUND .............................................................. 192 7.1.1 FORMAL P ROOFS...............................................192 7.1.2 COMPUTER-ASSISTED P RO O FS ..........................193 7.1.3 ISABELLE/H O L ...............................................194 7.2 THE INFORMAL P RO O F..................................................196 7.3 ISABELLE P R I M E R ........................................................202 7.3.1 S Y N TAX ........................................................... 202 7.3.2 G O N TE X T........................................................ 203 7.3.3 ADDING NEW F A C T S ..................................... 205 7.3.4 SOLVING G O A LS ...............................................205 7.3.5 A SSU M P TIO N S...............................................206 7.3.6 PROVING F A C TS ...............................................208 7.3.7 PROOF M E TH O D S ............................................210 7.3.8 RULES ........................................................... 212 7.3.9 NAMING F A C TS ...............................................213 7.3.10 FINDING F A C TS ...............................................214 7.3.11 QUANTIFICATION ............................................215 7.3.12 T Y P E S ........................................................... 219 7.3.13 EXPLORING F A C TS ............................................220 7.3.14 DEFINITIONS .................................................. 221 7.3.15 LOCALES ........................................................ 223 7.3.16 FURTHER R E A D IN G .........................................224 7.4 THE FORMAL PROOF .................................................. 226 7.5 TECHNICAL A SPECTS ..................................................... 228 7.5.1 GRAPHS ........................................................ 228 7.5.2 P A T H S ........................................................... 231 7.5.3 WELL-ORDERED S TRA TE G IE S ............................ 235 7.6 C ONCLUSIONS .............................................................. 239 7.6.1 TIME C OM PLEXITY.........................................239 7.6.2 TURING M AC H IN E S.........................................240 7.6.3 RESTRICTED GRAPH C LA S S E S ......................... 242 BIBLIOGRAPHY 243 INDEX 265 SYMBOLS 271
any_adam_object	1
author	Dittmann, Christoph
author_GND	(DE-588)1159925909
author_facet	Dittmann, Christoph
author_role	aut
author_sort	Dittmann, Christoph
author_variant	c d cd
building	Verbundindex
bvnumber	BV044644911
classification_rvk	ST 130 ST 620
collection	ebook
ctrlnum	(OCoLC)1012698682 (DE-599)DNB1127244396
dewey-full	511.3
dewey-hundreds	500 - Natural sciences and mathematics
dewey-ones	511 - General principles of mathematics
dewey-raw	511.3
dewey-search	511.3
dewey-sort	3511.3
dewey-tens	510 - Mathematics
discipline	Informatik Mathematik
doi_str_mv	10.14279/depositonce-5700
format	Thesis Electronic eBook
fullrecord	<?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>02431nmm a2200553 cb4500</leader><controlfield tag="001">BV044644911</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">20181016 </controlfield><controlfield tag="006">a m\|\|\| 00\|\|\| </controlfield><controlfield tag="007">cr\|uuu---uuuuu</controlfield><controlfield tag="008">171121s2017 gw \|\|\|\| o\|\|u\| \|\|\|\|\|\|eng d</controlfield><datafield tag="016" ind1="7" ind2=" "><subfield code="a">1127244396</subfield><subfield code="2">DE-101</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">9783798328884</subfield><subfield code="9">978-3-7983-2888-4</subfield></datafield><datafield tag="024" ind1="7" ind2=" "><subfield code="a">10.14279/depositonce-5700</subfield><subfield code="2">doi</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)1012698682</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)DNB1127244396</subfield></datafield><datafield tag="040" ind1=" " ind2=" "><subfield code="a">DE-604</subfield><subfield code="b">ger</subfield><subfield code="e">rda</subfield></datafield><datafield tag="041" ind1="0" ind2=" "><subfield code="a">eng</subfield></datafield><datafield tag="044" ind1=" " ind2=" "><subfield code="a">gw</subfield><subfield code="c">XA-DE-BE</subfield></datafield><datafield tag="049" ind1=" " ind2=" "><subfield code="a">DE-634</subfield><subfield code="a">DE-83</subfield></datafield><datafield tag="082" ind1="0" ind2=" "><subfield code="a">511.3</subfield><subfield code="2">22/ger</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">ST 130</subfield><subfield code="0">(DE-625)143588:</subfield><subfield code="2">rvk</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">ST 620</subfield><subfield code="0">(DE-625)143684:</subfield><subfield code="2">rvk</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">004</subfield><subfield code="2">sdnb</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Dittmann, Christoph</subfield><subfield code="e">Verfasser</subfield><subfield code="0">(DE-588)1159925909</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Parity games, separations, and the modal μ-calculus</subfield><subfield code="c">Christoph Dittmann</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">Berlin</subfield><subfield code="b">Universitätsverlag der TU Berlin</subfield><subfield code="c">2017</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">1 Online-Ressource (x, 274 Seiten)</subfield><subfield code="b">Diagramme</subfield><subfield code="c">21 cm</subfield></datafield><datafield tag="336" ind1=" " ind2=" "><subfield code="b">txt</subfield><subfield code="2">rdacontent</subfield></datafield><datafield tag="337" ind1=" " ind2=" "><subfield code="b">c</subfield><subfield code="2">rdamedia</subfield></datafield><datafield tag="338" ind1=" " ind2=" "><subfield code="b">cr</subfield><subfield code="2">rdacarrier</subfield></datafield><datafield tag="490" ind1="1" ind2=" "><subfield code="a">Foundations of computing</subfield><subfield code="v">9</subfield></datafield><datafield tag="502" ind1=" " ind2=" "><subfield code="b">Dissertation</subfield><subfield code="c">Technische Universität Berlin</subfield><subfield code="d">2017</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Paritätsspiel</subfield><subfield code="0">(DE-588)1141802864</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">My-Kalkül</subfield><subfield code="0">(DE-588)4530731-3</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="655" ind1=" " ind2="7"><subfield code="0">(DE-588)4113937-9</subfield><subfield code="a">Hochschulschrift</subfield><subfield code="2">gnd-content</subfield></datafield><datafield tag="689" ind1="0" ind2="0"><subfield code="a">My-Kalkül</subfield><subfield code="0">(DE-588)4530731-3</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="0" ind2="1"><subfield code="a">Paritätsspiel</subfield><subfield code="0">(DE-588)1141802864</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="0" ind2=" "><subfield code="5">DE-604</subfield></datafield><datafield tag="710" ind1="2" ind2=" "><subfield code="a">Technische Universität Berlin</subfield><subfield code="b">Universitätsbibliothek</subfield><subfield code="0">(DE-588)5053182-7</subfield><subfield code="4">pbl</subfield></datafield><datafield tag="776" ind1="0" ind2="8"><subfield code="i">Erscheint auch als</subfield><subfield code="n">Druck-Ausgae</subfield><subfield code="z">978-3-7983-2887-7</subfield><subfield code="w">(DE-604)BV044946663</subfield></datafield><datafield tag="830" ind1=" " ind2="0"><subfield code="a">Foundations of computing</subfield><subfield code="v">9</subfield><subfield code="w">(DE-604)BV044943050</subfield><subfield code="9">9</subfield></datafield><datafield tag="856" ind1="4" ind2="2"><subfield code="m">B:DE-101</subfield><subfield code="q">application/pdf</subfield><subfield code="u">http://d-nb.info/1127244396/04</subfield><subfield code="3">Inhaltsverzeichnis</subfield></datafield><datafield tag="856" ind1="4" ind2="0"><subfield code="u">https://depositonce.tu-berlin.de/bitstream/11303/6135/3/dittmann_christoph.pdf</subfield><subfield code="3">Volltext</subfield></datafield><datafield tag="856" ind1="4" ind2="0"><subfield code="u">https://depositonce.tu-berlin.de/handle/11303/6135</subfield><subfield code="3">Volltext</subfield></datafield><datafield tag="856" ind1="4" ind2="0"><subfield code="u">https://doi.org/10.14279/depositonce-5700</subfield><subfield code="x">Resolving-System</subfield><subfield code="z">kostenfrei</subfield><subfield code="3">Volltext</subfield></datafield><datafield tag="856" ind1="4" ind2="2"><subfield code="m">DNB Datenaustausch</subfield><subfield code="q">application/pdf</subfield><subfield code="u">http://bvbr.bib-bvb.de:8991/F?func=service&doc_library=BVB01&local_base=BVB01&doc_number=030042777&sequence=000001&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA</subfield><subfield code="3">Inhaltsverzeichnis</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">ebook</subfield></datafield><datafield tag="999" ind1=" " ind2=" "><subfield code="a">oai:aleph.bib-bvb.de:BVB01-030042777</subfield></datafield></record></collection>
genre	(DE-588)4113937-9 Hochschulschrift gnd-content
genre_facet	Hochschulschrift
id	DE-604.BV044644911
illustrated	Not Illustrated
indexdate	2024-07-10T07:58:06Z
institution	BVB
institution_GND	(DE-588)5053182-7
isbn	9783798328884
language	English
oai_aleph_id	oai:aleph.bib-bvb.de:BVB01-030042777
oclc_num	1012698682
open_access_boolean	1
owner	DE-634 DE-83
owner_facet	DE-634 DE-83
physical	1 Online-Ressource (x, 274 Seiten) Diagramme 21 cm
psigel	ebook
publishDate	2017
publishDateSearch	2017
publishDateSort	2017
publisher	Universitätsverlag der TU Berlin
record_format	marc
series	Foundations of computing
series2	Foundations of computing
spelling	Dittmann, Christoph Verfasser (DE-588)1159925909 aut Parity games, separations, and the modal μ-calculus Christoph Dittmann Berlin Universitätsverlag der TU Berlin 2017 1 Online-Ressource (x, 274 Seiten) Diagramme 21 cm txt rdacontent c rdamedia cr rdacarrier Foundations of computing 9 Dissertation Technische Universität Berlin 2017 Paritätsspiel (DE-588)1141802864 gnd rswk-swf My-Kalkül (DE-588)4530731-3 gnd rswk-swf (DE-588)4113937-9 Hochschulschrift gnd-content My-Kalkül (DE-588)4530731-3 s Paritätsspiel (DE-588)1141802864 s DE-604 Technische Universität Berlin Universitätsbibliothek (DE-588)5053182-7 pbl Erscheint auch als Druck-Ausgae 978-3-7983-2887-7 (DE-604)BV044946663 Foundations of computing 9 (DE-604)BV044943050 9 B:DE-101 application/pdf http://d-nb.info/1127244396/04 Inhaltsverzeichnis https://depositonce.tu-berlin.de/bitstream/11303/6135/3/dittmann_christoph.pdf Volltext https://depositonce.tu-berlin.de/handle/11303/6135 Volltext https://doi.org/10.14279/depositonce-5700 Resolving-System kostenfrei Volltext DNB Datenaustausch application/pdf http://bvbr.bib-bvb.de:8991/F?func=service&doc_library=BVB01&local_base=BVB01&doc_number=030042777&sequence=000001&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA Inhaltsverzeichnis
spellingShingle	Dittmann, Christoph Parity games, separations, and the modal μ-calculus Foundations of computing Paritätsspiel (DE-588)1141802864 gnd My-Kalkül (DE-588)4530731-3 gnd
subject_GND	(DE-588)1141802864 (DE-588)4530731-3 (DE-588)4113937-9
title	Parity games, separations, and the modal μ-calculus
title_auth	Parity games, separations, and the modal μ-calculus
title_exact_search	Parity games, separations, and the modal μ-calculus
title_full	Parity games, separations, and the modal μ-calculus Christoph Dittmann
title_fullStr	Parity games, separations, and the modal μ-calculus Christoph Dittmann
title_full_unstemmed	Parity games, separations, and the modal μ-calculus Christoph Dittmann
title_short	Parity games, separations, and the modal μ-calculus
title_sort	parity games separations and the modal μ calculus
topic	Paritätsspiel (DE-588)1141802864 gnd My-Kalkül (DE-588)4530731-3 gnd
topic_facet	Paritätsspiel My-Kalkül Hochschulschrift
url	http://d-nb.info/1127244396/04 https://depositonce.tu-berlin.de/bitstream/11303/6135/3/dittmann_christoph.pdf https://depositonce.tu-berlin.de/handle/11303/6135 https://doi.org/10.14279/depositonce-5700 http://bvbr.bib-bvb.de:8991/F?func=service&doc_library=BVB01&local_base=BVB01&doc_number=030042777&sequence=000001&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA
volume_link	(DE-604)BV044943050
work_keys_str_mv	AT dittmannchristoph paritygamesseparationsandthemodalmcalculus AT technischeuniversitatberlinuniversitatsbibliothek paritygamesseparationsandthemodalmcalculus

Verfügbarkeit

Es ist kein Print-Exemplar vorhanden.

Fernleihe Bestellen Achtung: Nicht im THWS-Bestand! Inhaltsverzeichnis
Volltext öffnen

MARC

Datensatz im Suchindex

Es ist kein Print-Exemplar vorhanden.

Ähnliche Einträge