The 10,000 facets of MDP model checking
This paper presents a retrospective view on probabilistic model checking. We focus on
Markov decision processes (MDPs, for short). We survey the basic ingredients of MDP …
Markov decision processes (MDPs, for short). We survey the basic ingredients of MDP …
On abstraction of probabilistic systems
Probabilistic model checking extends traditional model checking by incorporating
quantitative information about the probability of system transitions. However, probabilistic …
quantitative information about the probability of system transitions. However, probabilistic …
Coalgebraic trace semantics for continuous probabilistic transition systems
Coalgebras in a Kleisli category yield a generic definition of trace semantics for various
types of labelled transition systems. In this paper we apply this generic theory to generative …
types of labelled transition systems. In this paper we apply this generic theory to generative …
Performance preserving equivalence for stochastic process algebra dtsdPBC
IV Tarasyuk - Сибирские электронные математические известия, 2023 - mathnet.ru
Petri box calculus (PBC) of E. Best, R. Devillers, JG Hall and M. Koutny is a well-known
algebra of parallel processes with a Petri net semantics. Discrete time stochastic and …
algebra of parallel processes with a Petri net semantics. Discrete time stochastic and …
Deciding probabilistic automata weak bisimulation: theory and practice
LM Ferrer Fioriti, V Hashemi, H Hermanns… - Formal Aspects of …, 2016 - Springer
Weak probabilistic bisimulation on probabilistic automata can be decided by an algorithm
that needs to check a polynomial number of linear programming problems encoding weak …
that needs to check a polynomial number of linear programming problems encoding weak …
[HTML][HTML] Axiomatising infinitary probabilistic weak bisimilarity of finite-state behaviours
N Fischer, R van Glabbeek - Journal of Logical and Algebraic Methods in …, 2019 - Elsevier
In concurrency theory, weak bisimilarity is often used to relate processes exhibiting the same
observable behaviour. The probabilistic environment gives rise to several generalisations; …
observable behaviour. The probabilistic environment gives rise to several generalisations; …
Stochastic equivalence for performance analysis of concurrent systems in dtsiPBC
We propose an extension with immediate multiactions of discrete time stochastic Petri Box
Calculus (dtsPBC), presented by IV Tarasyuk. The resulting algebra dtsiPBC is a discrete …
Calculus (dtsPBC), presented by IV Tarasyuk. The resulting algebra dtsiPBC is a discrete …
Principles of Markov automata
CG Eisentraut - 2017 - publikationen.sulb.uni-saarland.de
A substantial amount of today's engineering problems revolve around systems that are
concurrent and stochastic by their nature. Solution approaches attacking these problems …
concurrent and stochastic by their nature. Solution approaches attacking these problems …
On the efficiency of deciding probabilistic automata weak bisimulation
Weak probabilistic bisimulation on probabilistic automata can be decided by an algorithm
that needs to check a polynomial number of linear programming problems encoding weak …
that needs to check a polynomial number of linear programming problems encoding weak …
[HTML][HTML] Markov Automata: Deciding weak bisimulation by means of non-naïvely vanishing states
J Schuster, M Siegle - Information and Computation, 2014 - Elsevier
This paper develops a decision algorithm for weak bisimulation on Markov Automata (MA).
For this purpose, different notions of vanishing states (a concept originating from the area of …
For this purpose, different notions of vanishing states (a concept originating from the area of …