The notion of process equivalence of probabilistic processes is sensitive to the exact
probabilities of transitions. Thus, a slight change in the transition probabilities will result in …

In this paper we introduce a new class of labelled transition systems—labelled Markov
processes—and define bisimulation for them. Labelled Markov processes are probabilistic …

Abstract Partial Labeled Markov Chains (plMc) generalize process algebra and traditional
Markov chains. They provide a foundation for interacting discrete probabilistic systems …

Parallel systems (such as operating systems, telecommunication systems, aircraft controlling
systems, banking systems, etc.) arise in many industrial applications. For applications where …

We observe that equivalence is not a robust concept in the presence of numerical
information-such as probabilities-in the model. We develop a metric analogue of weak …

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 …

The notion of bisimulation as proposed by Larsen and Skou for discrete probabilistic
transition systems is shown to coincide with a coalgebraic definition in the sense of Aczel …

In this chapter, we adopt Probabilistic Transition Systems as a basic model for probabilistic
processes, in which probabilistic and nondeterministic choices are independent concepts …

It has been argued that Boolean-valued logics and associated discrete notions of
behavioural equivalence sit uneasily with semantic models featuring quantitative data, like …

A category of HO/N-style games and probabilistic strategies is developed where the
possible choices of a strategy are quantified so as to give a measure of the likelihood of …