611 citations · 855 across the 28 of their papers we have counts for
4 papers · 1 filter
Cost Preserving Bisimulations for Probabilistic Automata
Andrea Turrini, Holger Hermanns
Probabilistic automata constitute a versatile and elegant model for concurrent probabilistic systems. They are equipped with a compositional theory supporting abstraction, enabled…
Analysis of Timed and Long-Run Objectives for Markov Automata
Dennis Guck, Hassan Hatefi, Holger Hermanns +2
Markov automata (MAs) extend labelled transition systems with random delays and probabilistic branching. Action-labelled transitions are instantaneous and yield a distribution over…
MeGARA: Menu-based Game Abstraction and Abstraction Refinement of Markov Automata
Bettina Braitling, Luis María Ferrer Fioriti, Hassan Hatefi +3
Markov automata combine continuous time, probabilistic transitions, and nondeterminism in a single model. They represent an important and powerful way to model a wide range of comp…
Probabilistic Bisimulation: Naturally on Distributions
Holger Hermanns, Jan Krčál, Jan Křetínský
In contrast to the usual understanding of probabilistic systems as stochastic processes, recently these systems have also been regarded as transformers of probabilities. In this pa…