(Enter summary)
Abstract: This paper is an attempt to integrate the algebra of communicating processes (ACP) and the
algebra of flownomials (AF). Basically, this means to combine axiomatized parallel and looping
operators. To this end we introduce a model of process graphs with multiple entries and exits.
In this model the usual operations of both algebras are defined, e.g. alternative composition
(this covers both the sum of ACP and the disjoint sum of AF), sequential composition, feedback,
parallel composition, left... (Update)
Context of citations to this paper: More
...theory is often given in terms of graphs. The process graphs considered usually have exactly one entry and exactly one exit. In [BeS94], this was adapted to allow for multiple entries and multiple exits. The resulting model was used to model key constructs of ACP and of...
Cited by: More
Process Algebra with Feedback - Baeten Bergstra Gh
(Correct)
Basic Multi-Competence Programming - Bergstra, Bethke, Ponse (2000)
(Correct)
Similar documents (at the sentence level):
19.4%: Processes with Multiple Entries and Exits - Bergstra, Stefanescu (1995)
(Correct)
Active bibliography (related documents): More All
2.0: Processes with Multiple Entries and Exits Modulo.. - Bergstra, Stefanescu (1994)
(Correct)
1.5: Algebra of Flownomials; Part 1: Binary Flownomials; Basic Theory - Stefanescu
(Correct)
0.4: Bisimulation is Two-Way Simulation - Bergstra, Stefanescu (1994)
(Correct)
Similar documents based on text: More All
0.3: Network Algebra for Asynchronous Dataflow - Bergstra, Middelburg, Stefanescu (1997)
(Correct)
0.2: Network Algebra with Demonic Relation Operators - Bergstra, Stefanescu
(Correct)
0.2: Network Algebra for Synchronous and Asynchronous Dataflow - Bergstra, Middelburg.. (1995)
(Correct)
Related documents from co-citation: More All
3: An algebraic speci cation of a model factory (context) - Brunekreef, Ponse
3: Discrete time process algebra (context) - Baeten, Bergstra
3: Process algebra with a zero object (context) - Baeten, Bergstra - 1990
BibTeX entry: (Update)
J.A. Bergstra and Gh. ¸ Stefanescu, Processes with multiple entries and exits modulo isomorphism and modulo bisimulation, report P9403, Programming Research Group, University of Amsterdam, 1994. http://citeseer.ist.psu.edu/article/bergstra94processes.html More
@article{ bergstra96processes,
author = "Jan A. Bergstra and Gheorghe Stefanescu",
title = "Processes with Multiple Entries and Exits Modulo Isomorphism and Modulo Bisimulation",
journal = "Fundamenta Informaticae",
volume = "27",
number = "1",
pages = "37-56",
year = "1996",
url = "citeseer.ist.psu.edu/article/bergstra94processes.html" }
Citations (may not include all citations):
854
Information and Computation (context) - Parrow, behavioural et al. - 1993
502
Concurrency and automata on infinite sequences (context) - Park - 1981
484
A calculus of communicating systems (context) - Milner - 1980
192
Representation of events in nerve nets and finite automata (context) - Kleene - 1956
139
Cambridge University Press (context) - Baeten, Weijland - 1990
27
Towards a new algebraic foundation of flowchart scheme theor.. (context) - Cazanescu, Stefanescu - 1990
21
Flowgraphs and flow algebra (context) - Milner - 1979
19
Process algebra with iteration
- Bergstra, Bethke et al. - 1994
18
Iteration theories: the equational logic of iterative proces.. (context) - Bloom, Esik - 1993
8
unfoldments and equivalence of flow diagram programs (context) - Goguen, correctness - 1974
7
Bisimulation is two-way simulation
- Bergstra, Stefanescu - 1994
7
Translations between flowchart schemes and process graphs (context) - Bergstra, Stefanescu - 1993
6
Manadic computation and iterative algebraic theories (context) - Elgot - 1975
5
Proces algebra for synchronous communication (context) - Bergstra, Klop - 1984
5
Partially additive categories and flow diagram semantics (context) - Arbib, Manes - 1980
5
Part I: The deterministic case (context) - Stefanescu, theories - 1987
4
Some geometrical categories associated with flowchart scheme.. (context) - Elgot - 1977
4
Iteration theory of synchronization trees (context) - Bloom, Esik et al. - 1993
4
Graph isomorphism models for noninterleaving process algebra (context) - Baeten, Bergstra - 1994
Documents on the same site (http://fermivista.math.jussieu.fr/http/www.wins.uva.nl.html): More
Forcing in Finite Structures - Zambella (1996)
(Correct)
From Box to TEX: An algebraic approach to the construction .. - van den Brand, Visser (1994)
(Correct)
Data Flow Analysis for Reverse Engineering - Moonen (1996)
(Correct)
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