Efficient Bisimilarities from Second-order Reaction Semantics for π-calculus
نویسندگان
چکیده
We investigate Leifer and Milner RPO approach for deriving efficient (finitely branching) LTS’s and bisimilarities for π-calculus. To this aim, we work in a category of second-order term contexts and we apply a general pruning technique, which allows to simplify the set of transitions in the LTS obtained from the original RPO approach. The resulting LTS and bisimilarity provide an alternative presentation of symbolic LTS and Sangiorgi’s open bisimilarity.
منابع مشابه
Efficient Bisimilarities from Second-Order Reaction Semantics for pi-Calculus
We investigate Leifer and Milner RPO approach for deriving efficient (finitely branching) LTS’s and bisimilarities for π-calculus. To this aim, we work in a category of second-order term contexts and we apply a general pruning technique, which allows to simplify the set of transitions in the LTS obtained from the original RPO approach. The resulting LTS and bisimilarity provide an alternative p...
متن کاملCharacterizing contextual equivalence in calculi with passivation
We study the problem of characterizing contextual equivalence in higher-orderlanguages with passivation. To overcome the difficulties arising in the proofof congruence of candidate bisimilarities, we introduce a new form of labelledtransition semantics together with its associated notion of bisimulation, whichwe call complementary semantics. Complementary semantics allows to...
متن کاملCongruence Properties for a Timed Extension of the π-Calculus
We propose equivalences and preorders with congruence properties for a timed extension of the π-calculus. We present a timed extension of syntax and basic operational semantics to the π-calculus. The derived timed bisimulation relations are shown to be non-input congruent. The timed bisimilarities equalize the bisimilar processes not only in actions but also in timing of the actions. For the pu...
متن کاملA Calculus of Truly Concurrent Mobile Processes
We make a mixture of Milner’s π-calculus and our previous work on truly concurrent process algebra, which is called πtc. We introduce syntax and semantics of πtc, its properties based on strongly truly concurrent bisimilarities. Also, we include an axiomatization of πtc. πtc can be used as a formal tool in verifying mobile systems in a truly concurrent flavor.
متن کاملVariations on Mobile Processes
The paper investigates a concurrent computation model, chi calculus, in which communications resemble cut eliminations for classical proofs. Two bisimilarities, local bisimilarity and barbed bisimilarity, on chi processes are studied and are shown to be congruence relations. The former equivalence turns out to be strictly stronger than the latter. It is shown that chi calculus is capable of mod...
متن کامل