Using Formal Concept Analysis in Mathematical Discovery. - Simon Colton; Daniel Wagner 002 (Calculemus/MKM, 2007)

Hintikka Games for PCTL on Labeled Markov Chains. - Harald Fecher; Michael Huth 001; Nir Piterman; Daniel Wagner 002 (QEST, 2008)

Three-Valued Abstractions of Markov Chains: Completeness for a Sizeable Fragment of PCTL. - Michael Huth 001; Nir Piterman; Daniel Wagner 002 (FCT, 2009)

PCTL model checking of Markov chains: Truth and falsity as winning strategies in games. - Harald Fecher; Michael Huth 001; Nir Piterman; Daniel Wagner 002 (Perform. Evaluation, 2010)

Finite-state abstractions for probabilistic computation tree logic. - Daniel Wagner 002 (2011)

p-Automata: New foundations for discrete-time probabilistic verification. - Michael Huth 001; Nir Piterman; Daniel Wagner 002 (Perform. Evaluation, 2012)