| Gh. Stefanescu, On flowchart theories, part I, the deterministic case, JCSS 35, 1987, pp. 163-191. |
No context found.
Gh. Stefanescu, On flowchart theories, part I, the deterministic case, JCSS 35, 1987, pp. 163-191.
....processes, and we analyse the algebra obtained. Then, we illustrate the expressive power of the general formalism, and sketch the extension of the theory with silent steps and abstraction. More about feedback and flowchart theories can be found in [BaWM94] Bar92] BlE93] CaS90, 92] Mil94] [Ste87a, 87b], Sta92] 2 Process Graphs over a Set of Pins We introduce process graphs over a set of edge labels and a set of pin names. Edge labels are, as usual, taken from a finite set of primitive actions A. This set A is a parameter of the theory. Pin names are taken from a set V , also a parameter ....
Gh. ¸ Stefanescu, On flowchart theories, part I, the deterministic case, JCSS 35, 1987, pp. 163-191.
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC