Sciweavers

269 search results - page 23 / 54
» Computational soundness of observational equivalence
Sort
View
CONCUR
2005
Springer
14 years 2 months ago
Deriving Weak Bisimulation Congruences from Reduction Systems
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...
Roberto Bruni, Fabio Gadducci, Ugo Montanari, Pawe...
SEFM
2006
IEEE
14 years 2 months ago
On Bisimilarities Induced by Relations on Actions
In this paper, we give a straightforward generalization of bisimulations to "bisimulations induced by a pair of relations" on the underlying action set. We establish tha...
S. Arun-Kumar
ICALP
2004
Springer
14 years 1 months ago
Syntactic Control of Concurrency
Abstract. We consider a finitary procedural programming language (finite data-types, no recursion) extended with parallel composition and binary semaphores. Having first shown t...
Dan R. Ghica, Andrzej S. Murawski, C.-H. Luke Ong
MFCS
1991
Springer
13 years 12 months ago
CCS Dynamic Bisimulation is Progressing
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...
Ugo Montanari, Vladimiro Sassone
BIRTHDAY
2005
Springer
14 years 2 months ago
Compositional Reasoning for Probabilistic Finite-State Behaviors
Abstract. We study a process algebra which combines both nondeterministic and probabilistic behavior in the style of Segala and Lynch’s simple probabilistic automata. We consider...
Yuxin Deng, Catuscia Palamidessi, Jun Pang