Summary: Finite-state concurrent programs can be expressed
Paul C. Attie
College of Computer Science,
360 Huntington Avenue, Boston, Massachusetts 02115.
We present a pairwise normal form for nite-state shared memory con-
current programs: all variables are shared between exactly two processes,
and the guards on transitions are conjunctions of conditions over this
pairwise shared state. This representation has been used to e∆ciently
(in polynomial time) synthesize and model-check correctness properties
of concurrent programs. Our main result is that any nite state concur-
rent program can be transformed into pairwise normal form. Specically,
if Q is an arbitrary nite-state shared memory concurrent program, then
there exists a nite-state shared memory concurrent program P expressed
in pairwise normal form such that P is strongly bisimilar to Q. Our result
is constructive: we give an algorithm for producing P , given Q.