Testing congruence for mobile processes

Authors:
Fu Yuxi
Affiliations:
Department of Computer Science, Shanghai Jiaotong University, Shanghai 200030, P.R. China
Venue:
Journal of Computer Science and Technology
Year:
2002

Citing 10
Cited 2

Algebraic theory of processes

Algebraic theory of processes
Communication and concurrency

Communication and concurrency
A calculus of mobile processes, II

Information and Computation
Symbolic bisimulations

MFPS '92 Selected papers of the meeting on Mathematical foundations of programming semantics
Algebraic theories for name-passing calculi

Information and Computation
Testing equivalence for mobile processes

Information and Computation
Variations on mobile processes

Theoretical Computer Science
Complete Inference Systems for Weak Bisimulation Equivalences in the pi-Calculus

TAPSOFT '95 Proceedings of the 6th International Joint Conference CAAP/FASE on Theory and Practice of Software Development
A Theory of Bisimulation for the pi-Calculus

CONCUR '93 Proceedings of the 4th International Conference on Concurrency Theory
A Proof Theoretical Approach to Communication

ICALP '97 Proceedings of the 24th International Colloquium on Automata, Languages and Programming

Tau laws for pi calculus

Theoretical Computer Science
Testing equivalence for asymmetric χ-calculus

AsiaMS '07 Proceedings of the IASTED Asian Conference on Modelling and Simulation

Quantified Score

Hi-index	0.00

Visualization

Abstract

Testing equivalence on π processes has been studied in literature. The equivalence is not closed under the input prefix operator and is therefore not a congruence relation. This note takes a look at testing congruence on finite π processes. A complete equational system is given for the congruence relation.