Deciding equivalence of functional schemes for parallel programs : (preprint)
Yu.P. Korablin · Centrum Wiskunde & Informatica (CWI), the national research institute for mathematics and computer science in the Netherlands · 1982
This paper presents two formal systems for proving equivalence of parallel programs.Most of the axioms and proof rules of the first system are taken from [l,2,3].The second system, which is an extension of the first system, is developed on the base of the proof system constructed in [3].We obtain a completeness result for a certain subset of expressions of the second system.In particular, this subset includes all expressions of the first system.The method we use for proving equivalence of parallel programs exhibits a formal resemblance to ~he method used by SALOMAA [4] for proving equivalence of expressions in the algebra of regular events.