Publications : Dietmar BERWANGER
-
[BD20]
-
D. Berwanger and L. Doyen.
Observation and Distinction. Representing Information in
Infinite Games.
In Proceedings of the 37th Annual Symposium on Theoretical
Aspects of Computer Science (STACS'20), Leibniz International
Proceedings in Informatics, pages 48:1--48:17, Montpellier, France, March
2020. Leibniz-Zentrum für Informatik.
doi:
10.4230/LIPIcs.STACS.2020.48.
[ BibTex |
DOI ]
-
[Bv18]
-
D. Berwanger and M. van den Bogaard.
Consensus Game Acceptors and Iterated Transductions.
International Journal of Foundations of Computer Science,
29(02):165--185, February 2018.
doi:
10.1142/S0129054118400026.
[ BibTex |
DOI |
Web page |
PDF ]
-
[BR17]
-
D. Berwanger and R. Ramanujam.
Deviator Detection under Imperfect Monitoring.
In Proceedings of the 5th International Workshop on Strategic
Reasoning (SR'17), Liverpool, UK, July 2017.
[ BibTex |
Web page |
PDF ]
-
[BM17]
-
D. Berwanger and A. B. Mathew.
Infinite games with finite knowledge gaps.
Information and Computation, 254:217--237, June 2017.
doi:
10.1016/j.ic.2016.10.009.
[ BibTex |
DOI |
Web page |
PDF ]
-
[BMv17]
-
D. Berwanger, A. B. Mathew, and M. van den Bogaard.
Hierarchical information and the synthesis of distributed
strategies.
Acta Informatica, June 2017.
doi:
10.1007/s00236-017-0306-5.
[ BibTex |
DOI |
Web page |
PDF ]
-
[BV15b]
-
D. Berwanger and M. Van den Bogaard.
Games with Delays. A Frankenstein Approach.
In Proceedings of the 35th Conference on Foundations of
Software Technology and Theoretical Computer Science (FSTTCS'15),
volume 45 of Leibniz International Proceedings in Informatics, pages
307--319, Bangalore, India, December 2015. Leibniz-Zentrum für
Informatik.
doi:
10.4230/LIPIcs.FSTTCS.2015.307.
[ BibTex |
DOI |
Web page |
PDF ]
-
[BMV15]
-
D. Berwanger, A. B. Mathew, and M. Van den Bogaard.
Hierarchical Information Patterns and Distributed Strategy
Synthesis.
In Proceedings of the 13th International Symposium on
Automated Technology for Verification and Analysis (ATVA'15),
volume 9364 of Lecture Notes in Computer Science, pages 378--393, Shanghai,
China, October 2015. Springer.
doi:
10.1007/978-3-319-24953-7_28.
[ BibTex |
DOI |
Web page |
PDF ]
-
[MDB15]
-
N. Markey, L. Doyen, and D. Berwanger.
Models for large-scale systems.
Cassting deliverable D1.3 (FP7-ICT-601148), September 2015.
17 pages.
[ BibTex |
Web page |
PDF ]
-
[BV15a]
-
D. Berwanger and M. Van den Bogaard.
Consensus Game Acceptors.
In Proceedings of the 19th International Conference on
Developments in Language Theory (DLT'15), volume 9168 of Lecture
Notes in Computer Science, pages 108--119, Liverpool, UK, July 2015.
Springer.
doi:
10.1007/978-3-319-21500-6_8.
[ BibTex |
DOI |
Web page |
PDF ]
-
[BM14]
-
D. Berwanger and A. B. Mathew.
Games with Recurring Certainty.
In Proceedings of the 2nd International Workshop on Strategic
Reasoning (SR'14), volume 146 of Electronic Proceedings in Theoretical
Computer Science, pages 91--96, Grenoble, France, April 2014.
doi:
10.4204/EPTCS.146.12.
[ BibTex |
DOI |
Web page |
PDF ]
-
[BS13]
-
D. Berwanger and O. Serre.
Théorie des jeux en informatique.
Technique et Science Informatiques, 32(9-10), December 2013.
[ BibTex |
Web page |
PDF ]
-
[BGKR12]
-
D. Berwanger, E. Grädel, L. Kaiser, and
R. Rabinovich.
Entanglement and the complexity of directed graphs.
Theoretical Computer Science, 463:2--25, December 2012.
doi:
10.1016/j.tcs.2012.07.010.
[ BibTex |
DOI |
Web page |
PDF ]
-
[BS12]
-
D. Berwanger and O. Serre.
Parity games on undirected graphs.
Information Processing Letters, 112(23):928--932, December 2012.
doi:
10.1016/j.ipl.2012.08.021.
[ BibTex |
DOI |
Web page |
PDF ]
-
[BKL12]
-
D. Berwanger, L. Kaiser, and S. Leßenich.
Solving Counter Parity Games.
In Proceedings of the 37th International Symposium on
Mathematical Foundations of Computer Science (MFCS'12), volume 7464
of Lecture Notes in Computer Science, pages 160--171, Bratislava, Slovakia,
August 2012. Springer.
doi:
10.1007/978-3-642-32589-2_17.
[ BibTex |
DOI |
Web page |
PDF ]
-
[BDH+12]
-
D. Berwanger, A. Dawar, P. Hunter, S. Kreutzer, and
J. Obdrzálek.
The DAG-width of directed graphs.
Journal of Combinatorial Theory, Series B, 102(4):900--923, July
2012.
doi:
10.1016/j.jctb.2012.04.004.
[ BibTex |
DOI |
Web page |
PDF ]
-
[BKP11]
-
D. Berwanger, L. Kaiser, and B. Puchala.
Perfect-Information Construction for Coordination in Games.
In Proceedings of the 31st Conference on Foundations of
Software Technology and Theoretical Computer Science (FSTTCS'11),
volume 13 of Leibniz International Proceedings in Informatics, pages
387--398, Mumbai, India, December 2011. Leibniz-Zentrum für Informatik.
doi:
10.4230/LIPIcs.FSTTCS.2011.387.
[ BibTex |
DOI |
Web page |
PDF ]
-
[BKL11]
-
D. Berwanger, L. Kaiser, and S. Leßenich.
Imperfect Recall and Counter Games.
Research Report LSV-11-20, Laboratoire Spécification et
Vérification, ENS Cachan, France, October 2011.
21 pages.
[ BibTex |
Web page |
PDF ]
-
[BK10]
-
D. Berwanger and L. Kaiser.
Information Tracking in Games on Graphs.
Journal of Logic, Language and Information, 19(4):395--412, October
2010.
doi:
10.1007/s10849-009-9115-8.
[ BibTex |
DOI |
Web page |
PDF ]
-
[BCD+10]
-
D. Berwanger, K. Chatterjee, L. Doyen, M. De Wulf, and
Th. A. Henzinger.
Strategy Construction for Parity Games with Imperfect
Information.
Information and Computation, 208(10):1206--1220, October 2010.
doi:
10.1016/j.ic.2009.09.006.
[ BibTex |
DOI |
Web page |
PS |
PDF ]
-
[Ber10]
-
D. Berwanger.
Infinite Coordination Games.
In Logic and the Foundations of Game and Decision Theory (LOFT8),
volume 6006 of Lecture Notes in Artificial Intelligence, pages 1--19.
Springer, 2010.
doi:
10.1007/978-3-642-15164-4_1.
[ BibTex |
DOI |
Web page |
PDF ]
-
[BCD+09]
-
D. Berwanger, K. Chatterjee, M. De Wulf, L. Doyen, and
Th. A. Henzinger.
Alpaga: A Tool for Solving Parity Games with Imperfect
Information.
In Proceedings of the 15th International Conference on Tools
and Algorithms for Construction and Analysis of Systems (TACAS'09),
volume 5505 of Lecture Notes in Computer Science, pages 58--61, York, UK,
March 2009. Springer.
doi:
10.1007/978-3-642-00768-2_7.
[ BibTex |
DOI |
Web page |
PDF ]
-
[BP09]
-
D. Berwanger and S. Pinchinat.
Game Quantification Patterns.
In Proceedings of the 3rd Indian Conference on Logic and
Applications (ICLA'09), volume 5378 of Lecture Notes in Artificial
Intelligence, pages 116--130, Chennai, India, January 2009. Springer.
doi:
10.1007/978-3-540-92701-3_8.
[ BibTex |
DOI |
Web page |
PDF ]
-
[BD08]
-
D. Berwanger and L. Doyen.
On the Power of Imperfect Information.
In Proceedings of the 28th Conference on Foundations of
Software Technology and Theoretical Computer Science (FSTTCS'08),
volume 2 of Leibniz International Proceedings in Informatics, Bangalore,
India, December 2008. Leibniz-Zentrum für Informatik.
[ BibTex |
Web page |
PDF ]
-
[BCD+08]
-
D. Berwanger, K. Chatterjee, L. Doyen, Th. A.
Henzinger, and S. Raje.
Strategy Construction for Parity Games with Imperfect
Information.
In Proceedings of the 19th International Conference on
Concurrency Theory (CONCUR'08), volume 5201 of Lecture Notes in
Computer Science, pages 325--339, Toronto, Canada, August 2008. Springer.
doi:
10.1007/978-3-540-85361-9_27.
[ BibTex |
DOI |
Web page |
PDF ]
-
[BGL07]
-
D. Berwanger, E. Grädel, and G. Lenzi.
The variable hierarchy of the μ-calculus is strict.
Theory of Computing Systems, 40(4):437--466, June 2007.
doi:
10.1007/s00224-006-1317-8.
[ BibTex |
DOI |
Web page |
PDF ]
-
[Ber07]
-
D. Berwanger.
Admissibility in infinite games.
In Proceedings of the 24th Annual Symposium on Theoretical
Aspects of Computer Science (STACS'07), volume 4393 of Lecture Notes
in Computer Science, pages 188--199, Aachen, Germany, February 2007.
Springer.
doi:
10.1007/978-3-540-70918-3_17.
[ BibTex |
DOI |
Web page |
PDF ]
-
[BJ06]
-
D. Berwanger and D. Janin.
Automata on Directed Graphs: Vertex versus Edge Marking.
In Proceedings of the 3rd International Conference on Graph
Transformations (ICGT'06), volume 4178 of Lecture Notes in Computer
Science, pages 46--60, Natal, Rio Grande do Norte, Brazil, September 2006.
Springer.
doi:
10.1007/11841883_5.
[ BibTex |
DOI |
Web page |
PDF ]
-
[BDHK06]
-
D. Berwanger, A. Dawar, P. Hunter, and S. Kreutzer.
DAG-width and parity games.
In Proceedings of the 23rd Annual Symposium on Theoretical
Aspects of Computer Science (STACS'06), volume 3884 of Lecture Notes
in Computer Science, pages 524--536, Marseilles, France, February 2006.
Springer.
doi:
10.1007/11672142_43.
[ BibTex |
DOI |
Web page |
PDF ]
-
[BG05]
-
D. Berwanger and E. Grädel.
Entanglement -- A Measure for the Complexity of Directed
Graphs with Applications to Logic and Games.
In Proceedings of the 11th International Conference on Logic
for Programming, Artificial Intelligence, and Reasoning (LPAR'04),
volume 3452 of Lecture Notes in Artificial Intelligence, pages 209--223,
Montevideo, Uruguay, March 2005. Springer.
[ BibTex |
Web page |
PDF ]
-
[BL05]
-
D. Berwanger and G. Lenzi.
The variable hierarchy of the μ-calculus is strict.
In Proceedings of the 22nd Annual Symposium on Theoretical
Aspects of Computer Science (STACS'05), volume 3404 of Lecture Notes
in Computer Science, pages 97--109, Stuttgart, Germany, February 2005.
Springer.
[ BibTex |
Web page |
PS ]
-
[Ber05]
-
D. Berwanger.
Games and Logical Expressiveness.
Ph.D. Thesis, Department of Computer Science, RWTH Aachen,
Germany, 2005.
[ BibTex |
Web page |
PDF ]
-
[BG04]
-
D. Berwanger and E. Grädel.
Fixed-Point Logics and Solitaire Games.
Theory of Computing Systems, 37(6):675--694, December 2004.
doi:
10.1007/s00224-004-1147-5.
[ BibTex |
DOI |
Web page |
PDF ]
-
[Ber03]
-
D. Berwanger.
Game Logic is Strong Enough for Parity Games.
Studia Logica, 75(2):205--219, November 2003.
doi:
10.1023/A:1027358927272.
[ BibTex |
DOI |
Web page |
PDF ]
-
[BGK03]
-
D. Berwanger, E. Grädel, and S. Kreutzer.
Once Upon a Time in the West. Determinacy, Complexity and
Definability of Path Games.
In Proceedings of the 10th International Conference on Logic
for Programming, Artificial Intelligence, and Reasoning (LPAR'03),
volume 2850 of Lecture Notes in Artificial Intelligence, pages 226--240,
Almaty, Kazakhstan, September 2003. Springer.
[ BibTex |
Web page |
PS ]
-
[BGL02]
-
D. Berwanger, E. Grädel, and G. Lenzi.
On the variable hierarchy of the modal μ-calculus.
In Proceedings of the 16th International Workshop on Computer
Science Logic (CSL'02), volume 2471 of Lecture Notes in Computer
Science, pages 352--366, Edinburgh, Scotland, UK, September 2002. Springer.
[ BibTex |
Web page |
PS ]
-
[BB02a]
-
D. Berwanger and A. Blumensath.
Automata for Guarded Fixed Point Logics.
In Automata, Logics, and Infinite Game: A Guide to
Current Research, volume 2500 of Lecture Notes in Computer Science,
chapter 19, pages 343--355. Springer, 2002.
[ BibTex |
Web page |
PS ]
-
[BB02b]
-
D. Berwanger and A. Blumensath.
The Monadic Theory of Tree-like Structures.
In Automata, Logics, and Infinite Game: A Guide to
Current Research, volume 2500 of Lecture Notes in Computer Science,
chapter 16, pages 285--301. Springer, 2002.
[ BibTex |
Web page |
PS ]
-
[BG01]
-
D. Berwanger and E. Grädel.
Games and Model Checking for Guarded Logics.
In Proceedings of the 8th International Conference on Logic
for Programming, Artificial Intelligence, and Reasoning (LPAR'01),
volume 2250 of Lecture Notes in Artificial Intelligence, pages 70--84,
Havana, Cuba, December 2001. Springer.
[ BibTex |
Web page |
PS ]
This file was generated by
bibtex2html 1.98.