Marcus Größer

J. ACM, 2012

Stochastic game logic.

[BibT_eX]

[DOI]

Acta Informatica, 2012

2009

Probabilistic Automata over Infinite Words: Expressiveness, Efficiency, and Decidability

[BibT_eX]

[DOI]

Proceedings of the Proceedings Eleventh International Workshop on Descriptional Complexity of Formal Systems, 2009

Probabilistic Acceptors for Languages over Infinite Words.

[BibT_eX]

[DOI]

Proceedings of the SOFSEM 2009: Theory and Practice of Computer Science, 2009

Recurrence and Transience for Probabilistic Automata.

[BibT_eX]

[DOI]

Mathieu Tracol

Proceedings of the IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, 2009

The Effect of Tossing Coins in Omega-Automata.

[BibT_eX]

[DOI]

Proceedings of the CONCUR 2009 - Concurrency Theory, 20th International Conference, 2009

Quantitative Analysis under Fairness Constraints.

[BibT_eX]

[DOI]

Proceedings of the Automated Technology for Verification and Analysis, 2009

2008

Reduction methods for probabilistic model checking.

[BibT_eX]

[DOI]

PhD thesis, 2008

Generating Compact MTBDD-Representations from ProbmelaSpecifications.

[BibT_eX]

[DOI]

Proceedings of the Model Checking Software, 2008

Reduction Techniques for Model Checking Markov Decision Processes.

[BibT_eX]

[DOI]

Proceedings of the Fifth International Conference on the Quantitative Evaluaiton of Systems (QEST 2008), 2008

Almost-Sure Model Checking of Infinite Paths in One-Clock Timed Automata.

[BibT_eX]

[DOI]

Proceedings of the Twenty-Third Annual IEEE Symposium on Logic in Computer Science, 2008

On Decision Problems for Probabilistic Büchi Automata.

[BibT_eX]

[DOI]

Proceedings of the Foundations of Software Science and Computational Structures, 2008

2007

Probabilistic and Topological Semantics for Timed Automata.

[BibT_eX]

[DOI]

Proceedings of the FSTTCS 2007: Foundations of Software Technology and Theoretical Computer Science, 2007

2006

On Reduction Criteria for Probabilistic Reward Models.

[BibT_eX]

[DOI]

Proceedings of the FSTTCS 2006: Foundations of Software Technology and Theoretical Computer Science, 2006

2005

ProbMela and verification of Markov decision processes.

[BibT_eX]

[DOI]

SIGMETRICS Perform. Evaluation Rev., 2005

Partial Order Reduction for Probabilistic Branching Time.

[BibT_eX]

[DOI]

Pedro R. D'Argenio

Proceedings of the Third Workshop on Quantitative Aspects of Programming Languages, 2005

Recognizing omega-regular Languages with Probabilistic Automata.

[BibT_eX]

[DOI]

Proceedings of the 20th IEEE Symposium on Logic in Computer Science (LICS 2005), 2005

Quantitative analysis of distributed randomized protocols.

[BibT_eX]

[DOI]

Proceedings of the 10th international workshop on Formal methods for industrial critical systems, 2005

Partial Order Reduction for Markov Decision Processes: A Survey.

[BibT_eX]

[DOI]

Proceedings of the Formal Methods for Components and Objects, 4th International Symposium, 2005

2004

On Probabilistic Computation Tree Logic.

[BibT_eX]

[DOI]

Proceedings of the Validation of Stochastic Systems - A Guide to Current Research, 2004

Partial Order Reduction for Probabilistic Systems.

[BibT_eX]

[DOI]

Proceedings of the 1st International Conference on Quantitative Evaluation of Systems (QEST 2004), 2004

PROBMELA: a modeling language for communicating probabilistic processes.

[BibT_eX]

[DOI]