AbstractThe aim of the note is to give a new proof of the characterization of weak bisimulation congruence in Milner's CCS (Calculus of Communicating Systems). The proof is new in that it does not need the assumption that for a given agent P there is a label λ, for which P is not in the domain of λ⇒
In this study, we present rule formats for four main notions of bisimulation with silent moves. Wea...
We present a call-by-need λ-calculus λND with an erratic non-deterministic operator pick and a non-r...
AbstractIn TCS 146, Bard Bloom presented rule formats for four main notions of bisimulation with sil...
AbstractThe aim of the note is to give a new proof of the characterization of weak bisimulation cong...
This paper shows that weak bisimulation congruence can be characterised as rooted weak bisimulation ...
Weak Observational Congruence (woc) defined on CCS agents is not a bisimulation since it does not re...
Abstract. In this paper, we study weak bisimulation congruences for the χ-calculus, a symmetric vari...
AbstractWe develop a theory of bisimulation equivalence for the broadcast calculus CBS. Both the str...
AbstractIn this study, we present rule formats for four main notions of bisimulation with silent mov...
In this paper, we study weak bisimulation congruences for the χ-calculus, a symmetric variant of the...
We give an axiomatisation of strong bisimilarity on a small fragment of CCSthat does not feature the...
International audienceWe give an axiomatisation of strong bisimilarity on a small fragment of CCS th...
Milner's Calculus of Communicating Systems (CCS) is extended with a mechanism for label passing - a...
We cast the notion of bisimulation in the Willems' behavioral setting. We show that in this setting,...
In TCS 146, Bard Bloom presented rule formats for four main notions of bisimulation with silent move...
In this study, we present rule formats for four main notions of bisimulation with silent moves. Wea...
We present a call-by-need λ-calculus λND with an erratic non-deterministic operator pick and a non-r...
AbstractIn TCS 146, Bard Bloom presented rule formats for four main notions of bisimulation with sil...
AbstractThe aim of the note is to give a new proof of the characterization of weak bisimulation cong...
This paper shows that weak bisimulation congruence can be characterised as rooted weak bisimulation ...
Weak Observational Congruence (woc) defined on CCS agents is not a bisimulation since it does not re...
Abstract. In this paper, we study weak bisimulation congruences for the χ-calculus, a symmetric vari...
AbstractWe develop a theory of bisimulation equivalence for the broadcast calculus CBS. Both the str...
AbstractIn this study, we present rule formats for four main notions of bisimulation with silent mov...
In this paper, we study weak bisimulation congruences for the χ-calculus, a symmetric variant of the...
We give an axiomatisation of strong bisimilarity on a small fragment of CCSthat does not feature the...
International audienceWe give an axiomatisation of strong bisimilarity on a small fragment of CCS th...
Milner's Calculus of Communicating Systems (CCS) is extended with a mechanism for label passing - a...
We cast the notion of bisimulation in the Willems' behavioral setting. We show that in this setting,...
In TCS 146, Bard Bloom presented rule formats for four main notions of bisimulation with silent move...
In this study, we present rule formats for four main notions of bisimulation with silent moves. Wea...
We present a call-by-need λ-calculus λND with an erratic non-deterministic operator pick and a non-r...
AbstractIn TCS 146, Bard Bloom presented rule formats for four main notions of bisimulation with sil...
DOI
Add to ORKG