6 citations · 8 across the 3 of their papers we have counts for
4 papers
Linear Distances between Markov Chains
Przemysław Daca, Thomas A. Henzinger, Jan Křetínský +1
We introduce a general class of distances (metrics) between Markov chains, which are based on linear behaviour. This class encompasses distances given topologically (such as the to…
Counterexample Explanation by Learning Small Strategies in Markov Decision Processes
Tomáš Brázdil, Krishnendu Chatterjee, Martin Chmelík +2
While for deterministic systems, a counterexample to a property can simply be an error trace, counterexamples in probabilistic systems are necessarily more complex. For instance, a…
Automata with Generalized Rabin Pairs for Probabilistic Model Checking and LTL Synthesis
Krishnendu Chatterjee, Andreas Gaiser, Jan Křetínský
The model-checking problem for probabilistic systems crucially relies on the translation of LTL to deterministic Rabin automata (DRW). Our recent Safraless translation for the LTL(…
On Refinements of Boolean and Parametric Modal Transition Systems
Jan Křetínský, Salomon Sickert
We consider the extensions of modal transition systems (MTS), namely Boolean MTS and parametric MTS and we investigate the refinement problems over both classes. Firstly, we reduce…