Comparison of Algorithms for Checking Emptiness on Büchi Automata. - Andreas Gaiser; Stefan Schwoon (MEMICS, 2009)

On least fixed points of systems of positive polynomials. - Javier Esparza; Andreas Gaiser; Stefan Kiefer (ACM Commun. Comput. Algebra, 2009)

Comparison of Algorithms for Checking Emptiness on Buechi Automata - Andreas Gaiser; Stefan Schwoon (CoRR, 2009)

Probabilistic Verification Techniques and Probabilistic Program Analysis. - Andreas Gaiser (AlgoSyn, 2010)

Computing Least Fixed Points of Probabilistic Systems of Polynomials. - Javier Esparza; Andreas Gaiser; Stefan Kiefer (STACS, 2010)

Probabilistic Abstractions with Arbitrary Domains. - Javier Esparza; Andreas Gaiser (SAS, 2011)

Rabinizer: Small Deterministic Automata for LTL(F, G). - Andreas Gaiser; Jan Kretínský; Javier Esparza (ATVA, 2012)

Proving Termination of Probabilistic Programs Using Patterns. - Javier Esparza; Andreas Gaiser; Stefan Kiefer (CAV, 2012)

Automata with Generalized Rabin Pairs for Probabilistic Model Checking and LTL Synthesis. - Krishnendu Chatterjee; Andreas Gaiser; Jan Kretínský (CAV, 2013)

A strongly polynomial algorithm for criticality of branching processes and consistency of stochastic context-free grammars. - Javier Esparza; Andreas Gaiser; Stefan Kiefer (Inf. Process. Lett., 2013)

Verification of Reachability Properties and Termination for Probabilistic Systems. - Andreas Gaiser (2013)