This paper presents various semantics in the branching-time spectrum of discrete-time and
continuous-time Markov chains (DTMCs and CTMCs). Strong and weak bisimulation …

A continuous-time Markov decision process (CTMDP) is a generalization of a continuous-
time Markov chain in which both probabilistic and nondeterministic choices co-exist. This …

A finite-state Markov chain M can be regarded as a linear transform operating on the set of
probability distributions over its node set. The iterative applications of M to an initial …

This article provides a survey of approximation metrics for stochastic processes. We deal
with Markovian processes in discrete time evolving on general state spaces, namely on …

We give a brief overview of operational models for concurrent systems that exhibit
probabilistic behavior, focussing on the interplay between probability and nondeterminism …

Formal methods initially focused on the mathematically precise specification, design and
analysis of functional aspects of software and hardware systems. In this context, model …

The branching-time temporal logic PCTL* has been intro-duced to specify quantitative
properties over probability systems, such as discrete-time Markov chains. Until now …

We consider bisimulation and weak bisimulation relations in the context of the labeled
Markov chains of Hansson and Jonsson, the concurrent labeled Markov chains of Philippou …

In this paper, we study several linear-time equivalences (Markovian trace equivalence,
failure and ready trace equivalence) for continuous-time Markov chains that refer to the …

Constraint automata have been used as an operational model for component connectors
that coordinate the cooperation and communication of the components by means of a …