J.C.M. Baeten, J.A. Bergstra, and Gh. Stefanescu. Process algebra with feedback. Home/Search Document Details and Download
Summary Related Articles Check |
This paper is cited in the following contexts:
A Generic Architecture for Data Flow Analysis to Support Reverse.. - Moonen (1997) (14 citations) (Correct)
....chaining for all variables (dotted arrows) The characters t and f denote the path that is taken when the condition of the while is respectively true or false. program fac begin declare input: natural, output: natural, repnr: natural, rep: natural; input : 3; output : 1; while (input 1 0) do rep : output; repnr : input; while (repnr 1 0) do output : output rep; repnr : repnr 1 od; input : input 1 od end program fac input : 3 output : 1 while (input 1 0) do t rep : output repnr : input while (repnr 1 0) do t output : output rep repnr : ....
.... t and f denote the path that is taken when the condition of the while is respectively true or false. program fac begin declare input: natural, output: natural, repnr: natural, rep: natural; input : 3; output : 1; while (input 1 0) do rep : output; repnr : input; while (repnr 1 0) do output : output rep; repnr : repnr 1 od; input : input 1 od end program fac input : 3 output : 1 while (input 1 0) do t rep : output repnr : input while (repnr 1 0) do t output : output rep repnr : repnr 1 input : input 1 end f f 4 A Generic ....
[Article contains additional citation context not shown here]
J.C.M. Baeten, J.A. Bergstra, and Gh. Stefanescu. Process algebra with feedback.
Generation of Components for Software Renovation.. - van den Brand.. (1997) (20 citations) (Correct)
.... of Amsterdam Programming Research Group Original Code Renovated Abstract Syntax Tree Transform Parse Unparse Code Generation of Components for Software Renovation Factories from Context free Grammars Mark van den Brand Alex Sellink Chris Verhoef Report P9705 June University of Amsterdam Department of Computer Science Programming Research Group Generation of components for software renovation factories from context free grammars Mark van den Brand Alex Sellink Chris Verhoef Report P9705 June M.G.J. van den Brand Programming Research Group ....
.... Grammars Mark van den Brand Alex Sellink Chris Verhoef Report P9705 June University of Amsterdam Department of Computer Science Programming Research Group Generation of components for software renovation factories from context free grammars Mark van den Brand Alex Sellink Chris Verhoef Report P9705 June M.G.J. van den Brand Programming Research Group Department of Computer Science University of Amsterdam Kruislaan 403 NL 1098 SJ Amsterdam The Netherlands tel. 31 20 525 7593 e mail: markvdb fwi.uva.nl M.P.A. Sellink Programming Research Group Department of Computer Science University of ....
[Article contains additional citation context not shown here]
J.C.M. Baeten, J.A. Bergstra, and Gh. Stefanescu. Process algebra with feedback.
Basic Multi-Competence Programming - Bergstra, Bethke, Ponse (2000) Self-citation (Bergstra) (Correct)
No context found.
J.C.M. Baeten, J.A. Bergstra, and Gh. Stefanescu. Process algebra with feedback.
Processes with Multiple Entries and Exits - Bergstra, Stefanescu (1995) Self-citation (Bergstra) (Correct)
....have presented a model of process graphs with multiple entries and exits. This model allows for a smooth integration of looping and parallel operators. Axiomatisations for such processes under graph isomorphism and strong bisimulation equivalences are given. An extension of this model is given in [BaBS95]. There more operations and results may be found, including axiomatisation results for parallel operators. ....
J.C.M. Baeten, J.A. Bergstra and Gh. Stefanescu. Process algebra with feedback. In: Proceedings of the workshop: Three Days of Bisimulation (Eds. A. Ponse, M. de Rijke and Y. Venema). To appear as: CSLI volume, Stanford, 1995.
Processes with Multiple Entries and Exits Modulo.. - Bergstra, Stefanescu (1994) Self-citation (Bergstra) (Correct)
....have presented a model of process graphs with multiple entries and exits. This model allows for a smooth integration of looping and parallel operators. Axiomatisations for such processes under graph isomorphism and strong bisimulation equivalences are given. An extension of this model is given in [3] where more operations and results may be found, for instance axiomatisations results for parallel operators. What we have achieved The present model is a natural extension of the usual model of single entry single exit process graphs. While preserving the properties of the original model, the ....
J.C.M. Baeten, J.A. Bergstra and Gh. Stefanescu. Process algebra with feedback. In: Modal logic and process algebra, (Eds. A. Ponse, M. de Rijke and Y. Venema), 13--38. CSLI Publications no. 53, Stanford, 1995.
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