On the stability semantics of combinational programs
In this paper we prove some properties of combinational programs which is an improvement of the results presented in our previous work. We prove the derivation of loop-programs for combinational ones by both event semantics and stability semantics. We give a normal form for syntactically well-formed combinational programs, and show that for them Dimitrov's multiple parallel approach and Zhu's shared store parallel approach are equivalent. © Springer-Verlag Berlin Heidelberg 2005.