Abstract
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.
Cite
CITATION STYLE
Van Dung, T. (2005). On the stability semantics of combinational programs. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 3722 LNCS, pp. 180–194). Springer Verlag. https://doi.org/10.1007/11560647_12
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
