20 search results - page 1 / 4 » Deriving Weak Bisimulation Congruences from Reduction System... |
CONCUR
2005
Springer
13 years 10 months ago
2005
Springer
The focus of process calculi is interaction rather than computation, and for this very reason: (i) their operational semantics is conveniently expressed by labelled transition syst...
FOSSACS
2008
Springer
13 years 6 months ago
2008
Springer
In recent years there have been several approaches for the automatic derivation of labels from an unlabeled reactive system. This can be done in such a way that the resulting bisim...
ICALP
1998
Springer
13 years 9 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...
ENTCS
2007
13 years 5 months ago
2007
We propose a process calculus to study the behavioural theory of Mobile Ad Hoc Networks. The operational semantics of our calculus is given both in terms of a Reduction Semantics ...
MFCS
1991
Springer
13 years 8 months ago
1991
Springer
Weak Observational Congruence (woc) defined on CCS agents is not a bisimulation since it does not require two states reached by bisimilar computations of woc agents to be still w...