J.A. Goguen. On homomorphism, correctness, termination, unfoldments and equivalence of flow diagram programs. Journal of Computer and System Sciences, 8:333--365, 1974.  Home/Search   Document Not in Database   Summary   Related Articles   Check

....process algebra with the feedback operation. Our goal is to define a process algebra in which all operators of ACP [6] are present as well as feedback, the key iteration construct of flowchart theories. To this end we combine the results of [2] 8] and various other results on flowchart theories [11, 13, 14, 16, 22, 23]. Like in flowchart schemes [23] feedback and alternative composition 3 suffice to express all finite state systems. Actually, 3 is a mixture of disjoint sum 8 , left composition with converses of functions and right composition with functions. In fact alternative composition and ....

....bisimulation definition. The second equivalent definition is an adaptation of the definition of the standard flowchart scheme equivalence is terms of simulation via functions. Simulation is a standard notion of graph homomorphism that has been used in the study of flow diagram programs (see, e.g. [15, 16, 22]) Bisimulation is an equivalence on transition systems introduced by Park [20] in connection with Milner s work on concurrency [19] In [8] it is shown that bisimulation is the equivalence relation generated by simulation via functions. The proof in [8] uses a translation between flowchart ....

J.A. Goguen. On homomorphism, correctness, termination, unfoldments and equivalence of flow diagram programs. Journal of Computer and System Sciences, 8:333--365, 1974.

....rule , a name which was also used in our previous papers. In an implicit way the enzymatic rule for functions appear in the axiomatization of iteration theories in [Esi80, BlEs93a] The simulation relation we are using here has the roots in the corresponding equivalence relations used in [Gog74, Elg77] where a kind of simulation via functions is present. Simulations via various classes of relations are used in [Ste87a, Ste87b, CaS90a] In a more abstract setting they are present in [CaS92] The example in section 7.1.1 is from [CaS92] Chapter 8 Deterministic one way behaviour (affi flow) ....

J.A. Goguen. On homomorphism, correctness, termination, unfoldments and equivalence of flow diagram programs. Journal of Computer and System Sciences, 8:333--365, 1974.

.... are mainly considered: to abstract from the selection of the nodes as for labelled partial orders becoming pomsets [21] and to abstract from equivalent behaviours as achieved by the graph congruence of bisimulation (e.g. 1] or that of flow equivalence (based on the concept of covering) [6, 24]. Another modification caused for the labelled partial order interpretation by the concept of non determinism is, on the one hand, the description of non deterministic behaviour by a set of (abstract) graphs [2, 21] on the other hand, the seperation of branching into non deterministic branching ....

Goguen, J.A., On homomorphisms, correctness, termination, unfoldments and equivalence of flow diagram programs, in: Journal of Computer and System Sciences 8 (1974) 333--365, Academic Press Inc.

....simulation via functions. The proof entirely rests on simple rules of the calculus of relations. Keywords: theory of computation, concurrency, transition systems, equivalence Simulation is a standard notion of graph homomorphism that has been used in the study of flow diagram programs (see, e.g. [4, 3, 7]) Bisimulation is an equivalence on transition systems introduced by Park [6] in connection with Milner s work on concurrency [5] In [2] we have shown that bisimulation is the equivalence relation generated by simulation via functions by using a translation between flowchart schemes and process ....

J.A. Goguen. On homomorphism, correctness, termination, unfoldments and equivalence of flow diagram programs. Journal of Computer and System Sciences, 8:333--365, 1974.

....a later paper. 2 1 INTRODUCTION Our goal is to define a process algebra on which all operators of ACP [BeK84] are present as well as feedback, the key iteration construct of flowchart theories. To this end we combine the results of [BaB94] BeS93] and various other results on flowchart theories [Gog74, Elg75, Ste87, Ste90, CaS90, BlE93]. Like in flowchart schemes [Ste90] feedback and alternative composition 3 suffice to express all finite state systems. 3 is a mixture of disjoint sum Phi , left composition with converses of functions and right composition with functions. In fact alternative composition and ....

....Theorem 9 The axioms in Table 1 are correct and complete for graph isomorphism without multiplicity. 2 3 Process graphs modulo bisimulation 3. 1 Simulation and bisimulation Simulation is a standard notion of graph homomorphism that has been used in the study of flow diagram programs (see, e.g. [Gog74, Elg77, Ste87]) Bisimulation is an equivalence on transition systems introduced by Park [Pa80] in connection with Milner s work on concurrency [Mil80] In [BeS93] we have shown that bisimulation is the equivalence relation generated by simulation via functions by using a translation between flowchart schemes ....

J.A. Goguen. On homomorphism, correctness, termination, unfoldments and equivalence of flow diagram programs. Journal of Computer and System Sciences, 8:333--365, 1974.

No context found.

J.A. Goguen. On homomorphism, correctness, termination, unfoldments and equivalence of flow diagram programs. Journal of Computer and System Sciences, 8:333--365, 1974.

No context found.

J.A. Goguen. On homomorphism, correctness, termination, unfoldments and equivalence of flow diagram programs. Journal of Computer and System Sciences, 8:333--365, 1974.

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