Understanding the mismatch combinator in Chi calculus
Theoretical Computer Science
Bisimulation Lattice of Chi Processes
ASIAN '98 Proceedings of the 4th Asian Computing Science Conference on Advances in Computing Science
Open Bisimulations on Chi Processes
CONCUR '99 Proceedings of the 10th International Conference on Concurrency Theory
Bisimulation congruence of ℵ-calculus
Information and Computation
Theoretical Computer Science
Testing equivalence for asymmetric χ-calculus
AsiaMS '07 Proceedings of the IASTED Asian Conference on Modelling and Simulation
Duality and i/o-types in the π-calculus
CONCUR'12 Proceedings of the 23rd international conference on Concurrency Theory
Name-Passing Calculi: From Fusions to Preorders and Types
LICS '13 Proceedings of the 2013 28th Annual ACM/IEEE Symposium on Logic in Computer Science
| Hi-index | 0.00 |
The paper proposes a new process algebra, called chi-calculus. The language differs from pi-calculus in several aspects. First it takes a more uniform view on input and output. Second, the closed names of the language is homogeneous in the sense that there is only one kind of bound names. Thirdly, the effects of communications in chi-calculus are delimited by localization operators, not by sequentiality combinator. Finally, the language cherishes more freedom of parallelism than pi-calculus. The algebraic properties of chi-processes are studied in terms of local bisimulation. It is shown that local bisimilarity is a congruence equivalence on chi-processes.