Highly Influenced

# CCS Expressions, Finite State Processes, and THree Problems of Equivalence

@inproceedings{Kanellakis1983CCSEF, title={CCS Expressions, Finite State Processes, and THree Problems of Equivalence}, author={Paris C. Kanellakis and Scott A. Smolka}, booktitle={PODC}, year={1983} }

- Published 1983 in PODC
DOI:10.1145/800221.806724

We examine the computational complexity of testing finite state processes for equivalence, in the Calculus of Communicating Systems (CCS). This equivalence problem in CCS is presented as a refinement of the familiar problem of testing whether two nondeterministic finite state automata (n.f.s.a.) accept the same language. Three notions of equivalence, proposed for CCS, are investigated: (1) observation equivalence, (2) congruence, and (3) failure equivalence. We show that observation equivalence… CONTINUE READING

Highly Cited

This paper has 23 citations. REVIEW CITATIONS