Daniel Wagner

p-Automata : Acceptors for Markov Chains

M. Huth, N. Piterman, Daniel Wagner, 2009 .

Finite-state abstractions for probabilistic computation tree logic

Daniel Wagner, Daniel Wagner, 2011 .

p-Automata: New Foundations for Discrete-Time Probabilistic Verification

Michael Huth, Daniel Wagner, Nir Piterman, 2010, 2010 Seventh International Conference on the Quantitative Evaluation of Systems.

PCTL model checking of Markov chains: Truth and falsity as winning strategies in games

Michael Huth, Daniel Wagner, Nir Piterman, 2010, Perform. Evaluation.

Three-Valued Abstractions of Markov Chains: Completeness for a Sizeable Fragment of PCTL

Michael Huth, Daniel Wagner, Nir Piterman, 2009, FCT.

Hintikka Games for PCTL on Labeled Markov Chains

Michael Huth, Daniel Wagner, Nir Piterman, 2008, 2008 Fifth International Conference on Quantitative Evaluation of Systems.

Using Formal Concept Analysis in Mathematical Discovery

Simon Colton, Daniel Wagner, S. Colton, 2007, Calculemus/MKM.

p-Automata: New Foundations for Discrete-Time Probabilistic Verification

M. Huth, Daniel Wagner, Yuyan Jiang, 2010, 2010 Seventh International Conference on the Quantitative Evaluation of Systems.