258 search results - page 4 / 52 » Weak Bisimulation Approximants |
ICALP
1998
Springer
15 years 1 months ago
1998
Springer
We generate a natural hierarchy of equivalences for asynchronous name-passing process calculi from simple variations on Milner and Sangiorgi's definition of weak barbed bisim...
IANDC
2010
14 years 8 months ago
2010
Abstract. We investigate weak bisimulation of probabilistic systems in the presence of nondeterminism, i.e. labelled concurrent Markov chains (LCMC) with silent transitions. We bui...
CDC
2009
IEEE
15 years 2 months ago
2009
IEEE
— This work is concerned with the problem of characterizing and computing probabilistic bisimulations of diffusion processes. A probabilistic bisimulation relation between two su...
CONCUR
1995
Springer
15 years 1 months ago
1995
Springer
Abstract. We exploit a notion of interface for Petri nets in order to design a set of net combinators. For such a calculus of nets, we focus on the behavioural congruences arising ...
ICALP
2005
Springer
15 years 3 months ago
2005
Springer
Abstract. We study the use of the elaboration preorder (due to ArunKumar and Natarajan) in the framework of up-to techniques for weak bisimulation. We show that elaboration yields ...