269 search results - page 23 / 54 » Computational soundness of observational equivalence |
132
click to vote
CONCUR
2005
Springer
15 years 11 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...
139
click to vote
SEFM
2006
IEEE
16 years 2 days ago
2006
IEEE
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...
147
click to vote
ICALP
2004
Springer
15 years 11 months ago
2004
Springer
Abstract. We consider a finitary procedural programming language (finite data-types, no recursion) extended with parallel composition and binary semaphores. Having first shown t...
185
click to vote
MFCS
1991
Springer
15 years 9 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...
147
click to vote
BIRTHDAY
2005
Springer
15 years 11 months ago
2005
Springer
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...