A complete axiomatisation for observational congruence of finite-state behaviours
Information and Computation
Selected papers of the Second Workshop on Concurrency and compositionality
A calculus of mobile processes, II
Information and Computation
Algebraic theories for name-passing calculi
Information and Computation
Testing equivalence for mobile processes
Information and Computation
On reduction-based process semantics
Selected papers of the thirteenth conference on Foundations of software technology and theoretical computer science
A theory of bisimulation for the &lgr;-calculus
Acta Informatica
Variations on mobile processes
Theoretical Computer Science
Communication and Concurrency
An Object Calculus for Asynchronous Communication
ECOOP '91 Proceedings of the European Conference on Object-Oriented Programming
ICALP '92 Proceedings of the 19th International Colloquium on Automata, Languages and Programming
Complete Proof Systems for Observation Congruences in Finite-Control pi-Calculus
ICALP '98 Proceedings of the 25th International Colloquium on Automata, Languages and Programming
Concurrent Constraints in the Fusion Calculus
ICALP '98 Proceedings of the 25th International Colloquium on Automata, Languages and Programming
On Asynchrony in Name-Passing Calculi
ICALP '98 Proceedings of the 25th International Colloquium on Automata, Languages and Programming
CONCUR '98 Proceedings of the 9th International Conference on Concurrency Theory
Unique Fixpoint Induction for Mobile Processes
CONCUR '95 Proceedings of the 6th International Conference on Concurrency Theory
On Bisimulations for the Asynchronous pi-Calculus
CONCUR '96 Proceedings of the 7th International Conference on Concurrency Theory
On Asynchronous Communication Semantics
ECOOP '91 Proceedings of the Workshop on Object-Based Concurrent Computing
A Proof Theoretical Approach to Communication
ICALP '97 Proceedings of the 24th International Colloquium on Automata, Languages and Programming
APDC '97 Proceedings of the 1997 Advances in Parallel and Distributed Computing Conference (APDC '97)
The Fusion Calculus: Expressiveness and Symmetry in Mobile Processes
LICS '98 Proceedings of the 13th Annual IEEE Symposium on Logic in Computer Science
Barbed congruence of asymmetry and mismatch
Journal of Computer Science and Technology
Testing equivalence for asymmetric χ-calculus
AsiaMS '07 Proceedings of the IASTED Asian Conference on Modelling and Simulation
Formalizing the environment view of process equivalence
CIS'04 Proceedings of the First international conference on Computational and Information Science
The early and late congruences for asymmetric χ≠ -calculus
CIS'04 Proceedings of the First international conference on Computational and Information Science
On the bisimulation congruence in χ-calculus
FSTTCS '05 Proceedings of the 25th international conference on Foundations of Software Technology and Theoretical Computer Science
| Hi-index | 5.23 |
The theory of chi processes with the mismatch operator is studied. Four congruence relations are investigated. These are late open congruence, early open congruence, ground congruence and barbed congruence. The late and early open congruence relations are the chi calculus counterparts of the weak late and early congruence relations of pi calculus. Both turn out to be special cases of the ground congruence and the barbed congruence. The ground congruence is essentially the open congruence. Complete systems are given for all the four congruence relations. These systems use some interesting tau laws unknown from previous studies of the chi calculus without the mismatch combinator. The results of this paper point out that the mismatch operator changes the algebraic semantics of chi calculus dramatically. They also correct some common mistakes in literature.