258 search results - page 1 / 52 » Weak Bisimulation Approximants |
CSL
2006
Springer
13 years 8 months ago
2006
Springer
Abstract. Bisimilarity and weak bisimilarity are canonical notions of equivalence between processes, which are defined co-inductively, but may be approached
CALCO
2009
Springer
13 years 11 months ago
2009
Springer
Abstract. Labelled Markov processes are continuous-state fully probabilistic labelled transition systems. They can be seen as co-algebras of a suitable monad on the category of mea...
ENTCS
1998
13 years 4 months ago
1998
This paper shows how modal mu-calculus formulae characterizing finite-state processes up to strong or weak bisimulation can be derived directly from the well-known greatest fixp...
BIRTHDAY
2005
Springer
13 years 10 months ago
2005
Springer
This paper shows that weak bisimulation congruence can be characterised as rooted weak bisimulation equivalence, even without making assumptions on the cardinality of the sets of s...
TCS
2010
12 years 11 months ago
2010
We are interested in describing timed systems that exhibit probabilistic behaviour. To this purpose, we consider a model of Probabilistic Timed Automata and introduce a concept of ...