A Perspective on "CCS Expressions, Finite State Processes, and Three Problems of Equivalence"

Abstract

With the publication of the Kannellakis-Smolka 1983 PODC paper, Kanellakis and Smolka pioneered the development of efficient algorithms for deciding behavioral equivalence of concurrent and distributed processes, especially bisimulation equivalence. Bisimulation is the cornerstone of the process-algebraic approach to modeling and verifying concurrent and distributed systems. They also presented complexity results that showed certain behavioral equivalences are computationally intractable. Collectively, their results founded the subdiscipline of algorithmic process theory, and established the associated bridges between the European research community, whose focus at the time was on process theory, and that of the US, with a rich tradition in algorithm design and computational complexity, but to whom process theory was largely unknown.