Communicating sequential processes
Communicating sequential processes
A calculus of mobile processes, I
Information and Computation
MFPS '92 Selected papers of the meeting on Mathematical foundations of programming semantics
Testing equivalence for mobile processes
Information and Computation
A symbolic semantics for the &pgr;-calculus
Information and Computation
Variations on mobile processes
Theoretical Computer Science
Communication and Concurrency
Algebraic Theory of Processes
Testing congruence for mobile processes
Journal of Computer Science and Technology
Understanding the mismatch combinator in Chi calculus
Theoretical Computer Science
An Object Calculus for Asynchronous Communication
ECOOP '91 Proceedings of the European Conference on Object-Oriented Programming
Process theory based on bisimulation semantics
Linear Time, Branching Time and Partial Order in Logics and Models for Concurrency, School/Workshop
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)
Hi-index | 0.00 |
We study testing equivalence for asymmetric χ-calculus in this paper. Our focus is to introduce a proof system including the laws for both strong observational equivalence and invisible actions. Soundness and completeness of the proof system w.r.t a testing preorder is presented that takes advantage of reductions of processes to normal forms.