Graph Isomorphism Models for Non Interleaving Process Algebra

Baeten, J.C.M.; Bergstra, JA Jan

doi:10.1007/978-1-4471-2120-6_13

Cited by 2 publications

(3 citation statements)

References 9 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…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 " " suffice to express all finite state systems.…”

Section: Introductionmentioning

confidence: 99%

“…*An extended abstract of this paper has been presented at FCT'95 conference in Dresden and has been published in its proceedings [9]. Technically we depart from the graph isomorphism model for the operators of ACP that was outlined in [2]. This model is adapted to allow for process graphs with multiple entry states and multiple exit states.…”

Section: Introductionmentioning

confidence: 99%

“…The communication function is undefined, except for the pairs {(1,8),(2,5),(3,4)) Parallel composition function >< is not explicitely stated. The final result is obtained by applying >< to all the states of the graph P" in Figure 7 which are pairs of states of P and P'.…”

mentioning

confidence: 99%

See 2 more Smart Citations

Processes With Multiple Entries and Exits Modulo Isomorphism and Modulo Bisimulation

Bergstra

Ştefănescu

1996

Fundamenta Informaticae

View full text Add to dashboard Cite

This paper proposes a framework for the integration of the algebra of communicating processes (ACP) and the algebra of flownomials (AF). Basically, this means to combine axiomatisations of parallel and looping operators. To this end a model of process graphs with multiple entries and exits is introduced. In this model the usual operations of both algebras are defined, e.g. alternative composition, sequential composition, feedback, parallel composition, left merge, communication merge, encapsulation, etc. The main results consist of correct and complete axiomatisations for process graphs modulo isomorphism and modulo bisimulation.

show abstract

Section: Introductionmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

See 1 more Smart Citation

Processes With Multiple Entries and Exits Modulo Isomorphism and Modulo Bisimulation

Bergstra

Ştefănescu

1996

Fundamenta Informaticae

View full text Add to dashboard Cite

show abstract

Processes with multiple entries and exits

Bergstra

Ştefănescu

1995

Fundamentals of Computation Theory

View full text Add to dashboard Cite

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 merge, communication merge, encapsulation, etc. The main results consist of correct and complete axiomatisations of process graphs modulo isomorphism and modulo bisimulation.

show abstract

Graph Isomorphism Models for Non Interleaving Process Algebra

Abstract: We present a simple and intuitive model for the syntax of ACP based on graph isomorphism. We prove an expressivity result, and use the model to determine the number of states of a process.

Cited by 2 publications

References 9 publications

Processes With Multiple Entries and Exits Modulo Isomorphism and Modulo Bisimulation

Processes With Multiple Entries and Exits Modulo Isomorphism and Modulo Bisimulation

Processes with multiple entries and exits

Contact Info

Product

Resources

About