2008
DOI: 10.2168/lmcs-4(2:4)2008
|View full text |Cite
|
Sign up to set email alerts
|

Abstract: Abstract. We give an axiomatisation of strong bisimilarity on a small fragment of CCS that does not feature the sum operator. This axiomatisation is then used to derive congruence of strong bisimilarity in the finite π-calculus in absence of sum. To our knowledge, this is the only nontrivial subcalculus of the π-calculus that includes the full output prefix and for which strong bisimilarity is a congruence.

Help me understand this report
View preprint versions

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

0
24
0

Year Published

2008
2008
2021
2021

Publication Types

Select...
4
1
1

Relationship

1
5

Authors

Journals

citations
Cited by 10 publications
(24 citation statements)
references
References 12 publications
0
24
0
Order By: Relevance
“…As [13,2] shows, bisimilarity is not substitution closed when both replication and name restriction are present in the calculus, and we have established in [5] that it is when we renounce to replication. To our knowledge, congruence of bisimilarity in the restriction-free π-calculus with replication is an open problem [13]; we provide here a partial answer.…”
Section: Introductionmentioning
confidence: 79%
See 3 more Smart Citations
“…As [13,2] shows, bisimilarity is not substitution closed when both replication and name restriction are present in the calculus, and we have established in [5] that it is when we renounce to replication. To our knowledge, congruence of bisimilarity in the restriction-free π-calculus with replication is an open problem [13]; we provide here a partial answer.…”
Section: Introductionmentioning
confidence: 79%
“…The inclusions and the substitution closure of∼ are straightforward. On finite processes, ≡ = ∼ was proved in in [5], and one can deduce from other results therein that∼ ⊆ ∼ (a proof is given for π in appendix-Thm. B4).…”
Section: Factmentioning
confidence: 90%
See 2 more Smart Citations
“…The key law for the axiomatization, and the following results, are inspired by similar results by Hirschkoff and Pous [4] for pure CCS. Using their terminology, we call distribution law, briefly (DIS), the axiom schema below (…”
Section: Corollary 64 (Cancellation)mentioning
confidence: 95%