Proceedings of the 33rd Annual ACM/IEEE Symposium on Logic in Computer Science 2018
DOI: 10.1145/3209108.3209125
|View full text |Cite
|
Sign up to set email alerts
|

Quasi-Open Bisimilarity with Mismatch is Intuitionistic

Abstract: Quasi-open bisimilarity is the coarsest notion of bisimilarity for the π-calculus that is also a congruence. This work extends quasi-open bisimilarity to handle mismatch (guards with inequalities). This minimal extension of quasi-open bisimilarity allows fresh names to be manufactured to provide constructive evidence that an inequality holds. The extension of quasi-open bisimilarity is canonical and robust-coinciding with open barbed bisimilarity (an objective notion of bisimilarity congruence) and characteris… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

0
25
0

Year Published

2019
2019
2023
2023

Publication Types

Select...
3
3

Relationship

3
3

Authors

Journals

citations
Cited by 16 publications
(25 citation statements)
references
References 18 publications
0
25
0
Order By: Relevance
“…2. When a distinguishing strategy is discovered using open bisimilarity, we determine whether it is an attack by constructing a distinguishing formula in an intermediate modal logic called intuitionistic FM [21,22]. 3.…”
Section: Discussionmentioning
confidence: 99%
“…2. When a distinguishing strategy is discovered using open bisimilarity, we determine whether it is an attack by constructing a distinguishing formula in an intermediate modal logic called intuitionistic FM [21,22]. 3.…”
Section: Discussionmentioning
confidence: 99%
“…Fortunately, we will see in this paper that quasi-open bisimilarity addresses the above limitation of open bisimilarity. Quasi-open bisimilarity is also intuitionistic [29]. It handles open terms (with free variables) intuitionistically; but handles private messages that an attacker cannot interfere with more subtly.…”
Section: A Finer Equivalence Discovers Spurious Attacksmentioning
confidence: 99%
“…Considering all contexts at every execution step reflects that new knowledge about the environment may be discovered during execution. Such testing equivalences have been used to inform the design of labelled transition systems and their corresponding notions of labelled equivalence for a range of process calculi including the π-calculus, which led to the emergence of quasi-open bisimilarity [29,41] -the notion of labelled bisimilarity that coincides with open barbed bisimilarity for the π-calculus.…”
Section: Introductionmentioning
confidence: 99%
“…Results in subsequent sections do not depend on intuitionistic negation. However, related work [HALT18] highlights that intuitionistic negation has a role when logically characterising open bisimilarity for processes with mismatch (inequality guards, which can model the else branch of an if-then-else statement). Thus this formulation of OM is robust for some useful extensions of the π-calculus.…”
Section: 2mentioning
confidence: 99%
“…Secondly, results obtained using such a more abstract approach should be treated with caution, since it does not immediately cover many richer process calculi, for which the definition of open bisimilarity must be modified. For example, when extending our results to the π-calculus with mismatch [HALT18], we require that the definition of open bisimilarity is extended to allow for the retrospective creation of fresh private names in the past, when our supply of private names runs out, otherwise open bisimilarity is not a congruence. Going further, for the applied π-calculus [ABF18] or ψcalculi [BJPV11], to define open bisimilarity the labels employed are of a more general form, so both the labels and the definition of open bisimilarity change in order to conservatively extend open bisimilarity to these settings while retaining the property that open bisimilarity is a congruence [HM21].…”
Section: Lemma 43 (Image Finitenessmentioning
confidence: 99%