• Average-price and reachability-price games on hybrid automata with strong resets
(co-authors:  Patricia Bouyer, Thomas Brihaye, Ranko Lazic, Michal Rutkowski)
To apper in Proceedings of 6th International Conference on Formal Modelling and Analysis of Timed Systems, FORMATS 2008, September 2008
 
• Concavely-priced timed automata
(co-author:  Ashutosh Trivedi)
To appear in Proceedings of 6th International Conference on Formal Modelling and Analysis of Timed Systems, FORMATS 2008, September 2008
 
• A deterministic subexponential algorithm for solving parity games
[Abstract] [BibTeX entry]
(co-authors:  Mike Paterson and  Uri Zwick)
To appear in SIAM Journal on Computing, 2008
(Modified and extended version of the paper in Proceedings of ACM-SIAM Symposium on Discrete Algorithms, SODA 2006, January 2006)
 
• Model checking probabilistic timed automata with one or two clocks
(co-authors:  François Laroussinie and  Jeremy Sproston)
To appear in Logical Methods in Computer Science, 2008
(Modified and extended version of the paper in Proceedings of 13th Conference on Tools and Algorithms for the Construction and Analysis of Systems, TACAS 2007, March 2007)
 
• A simple P-matrix linear complementarity problem for discounted games
(co-author:  Rahul Savani)
Proceedings of Computability in Europe, Logic and Theory of Algorithms, CiE 2008, June 2008
 
• Reachability-time games on timed automata
(co-author:  Ashutosh Trivedi)
Proceedings of 34th International Colloquium on Automata, Languages and Programming, ICALP 2007, July 2007
 
• Alternation-free modal mu-calculus for data trees
(co-author:  Ranko Lazic)
Proceedings of 22nd Annual IEEE Symp. on Logic in Computer Science, LICS 2007, July 2007
 
• Games with secure equilibria
[Abstract] [BibTeX entry]
(co-authors:  Krishnendu Chatterjee and  Thomas A. Henzinger )
Theoretical Computer Science, 365(1-2), November 2006
(Modified and extended version of the paper in Proceedings of 19th Annual IEEE Symp. on Logic in Computer Science, LICS 2004, July 2004)
 
• Calculating probabilities of real-time test cases
[Abstract] [BibTeX entry]
(co-authors:  Doron Peled and  Hongyang Qu )
Proceedings of 5th International Workshop on Formal Approaches to Testing of Software, FATES 2005, July 2005
 
• Mean-payoff parity games
[Abstract] [BibTeX entry]
(co-authors:  Krishnendu Chatterjee and  Thomas A. Henzinger )
Proceedings of 20th Annual IEEE Symp. on Logic in Computer Science, LICS 2005, June 2005
 
• On Nash equilibria in stochastic games
[Abstract] [BibTeX entry]
(co-authors:  Krishnendu Chatterjee and  Rupak Majumdar )
Proceedings of 13th Annual Conf. of the Europan Association for Computer Science Logic, CSL 2004, September 2004
 
• Quantitative stochastic parity games
[Abstract] [BibTeX entry]
(co-authors:  Krishnendu Chatterjee and  Thomas A. Henzinger )
Proceedings of ACM-SIAM Symposium on Discrete Algorithms, SODA 2004, January 2004
 
• Simple stochastic parity games
Copyright 2003 Springer-Verlag
[Abstract] [BibTeX entry]
(co-authors:  Krishnendu Chatterjee and  Thomas A. Henzinger )
Proceedings of 12th Annual Conf. of the Europan Association for Computer Science Logic, CSL 2003, August 2003
 
• Undecidability of domino games and hhp-bisimilarity
Copyright 2003 Elsevier Science (USA)
[Abstract] [BibTeX entry]
(co-authors: Mogens Nielsen and Jiri Srba)
Information and Computation, 184(2), August 2003
 
• Trading probability for fairness
Copyright 2002 Springer-Verlag
[Abstract] [BibTeX entry] [Slides]
(co-authors:  Orna Kupferman and  Thomas A. Henzinger )
Proceedings of 11th Annual Conf. of the Europan Association for Computer Science Logic, CSL 2002, September 2002
 
• Interface compatibility checking for software modules
Copyright 2002 Springer-Verlag
[Abstract] [BibTeX entry]
(co-authors: Arindam Chakrabarti, Luca de Alfaro, Thomas A. Henzinger and  Freddy Mang)
Proceedings of 14th Int. Conf. on Computer Aided Verification, CAV 2002, July 2002
 
• A discrete strategy improvement algorithm for solving parity games
Copyright 2000 Springer-Verlag
[Abstract] [BibTeX entry] [Slides]
[A revised and extended version,  BRICS Technical Report 00-48, December 2000]
(co-author: Jens Vöge)
Proceedings of 12th Int. Conf. on Computer Aided Verification, CAV 2000, July 2000
 
• Small progress measures for solving parity games
Copyright 2000 Springer-Verlag
[Abstract] [BibTeX entry] [Slides] [Comments]
Proceedings of 17th Int. Symp. on Theoretical Aspects of Computer Science, STACS 2000, February 2000
 
• Hereditary history preserving bisimilarity is undecidable
Copyright 2000 Springer-Verlag
[Abstract] [BibTeX entry]
(co-author: Mogens Nielsen)
Proceedings of 17th Int. Symp. on Theoretical Aspects of Computer Science, STACS 2000, February 2000
 
• Deciding the winner in parity games is in UP and co-UP
Copyright 1998 Elsevier Science B.V.
[Abstract] [BibTeX entry]
Information Processing Letters, 68(3), November 1998
 
• How much memory is needed to win infinite games?
[Abstract] [BibTeX entry]
[A revised and extended version, unfinished draft, September 1998]
(co-authors: Stefan Dziembowski and Igor Walukiewicz)
Proceedings of 12th Annual IEEE Symp. on Logic in Computer Science, LICS'97, July 1997

Games for Verification: Algorithmic Issues

[Abstract] [BibTeX entry]
Ph.D. Dissertation, BRICS, University of Aarhus, Denmark, October 2000

• I. etap Olimpiady Informatycznej 2000/2001: Opracowanie zadania "Gra w zielone"(in Polish)
In VIII. Olimpiada Informatyczna 2000/2001, Seria "Niebieskie ksiazeczki", May 2001

• On the expression complexity of the modal mu-calculus model checking
[Abstract] [BibTeX entry]
(co-authors: Stefan Dziembowski and Damian Niwiński)
Unpublished manuscript, November 1996