Andreas Gaiser

PhD thesis, 2013

A strongly polynomial algorithm for criticality of branching processes and consistency of stochastic context-free grammars.

[BibT_eX]

[DOI]

Inf. Process. Lett., 2013

Automata with Generalized Rabin Pairs for Probabilistic Model Checking and LTL Synthesis.

[BibT_eX]

[DOI]

Krishnendu Chatterjee

Jan Kretínský

Proceedings of the Computer Aided Verification - 25th International Conference, 2013

2012

Proving Termination of Probabilistic Programs Using Patterns.

[BibT_eX]

[DOI]

Proceedings of the Computer Aided Verification - 24th International Conference, 2012

Rabinizer: Small Deterministic Automata for LTL(F, G).

[BibT_eX]

[DOI]

Jan Kretínský

Proceedings of the Automated Technology for Verification and Analysis, 2012

2011

Probabilistic Abstractions with Arbitrary Domains.

[BibT_eX]

[DOI]

Proceedings of the Static Analysis - 18th International Symposium, 2011

2010

Computing Least Fixed Points of Probabilistic Systems of Polynomials.

[BibT_eX]

[DOI]

Proceedings of the 27th International Symposium on Theoretical Aspects of Computer Science, 2010

Probabilistic Verification Techniques and Probabilistic Program Analysis.

[BibT_eX]

Proceedings of the Joint Workshop of the German Research Training Groups in Computer Science, 2010

2009

Comparison of Algorithms for Checking Emptiness on Buechi Automata

[BibT_eX]

[DOI]

Stefan Schwoon

CoRR, 2009

On least fixed points of systems of positive polynomials.

[BibT_eX]

[DOI]

ACM Commun. Comput. Algebra, 2009

Comparison of Algorithms for Checking Emptiness on Büchi Automata.

[BibT_eX]

[DOI]