In this paper, we present a number of closely related models of process algebra, called finite-graph models. In a finite-graph model of process algebra, each process is a bisimulafion class of a particular kind of process graphs, called recursive process graphs. Just as in the standard graph model, each guarded each guarded recursive specification has exactly one solution in a finite-graph model, but in contrast to the standard graph model, this solution can be shown to contain a finite recursive process graph as element.
|Number of pages||15|
|Publication status||Published - Aug 1991|
|Event||2nd International Conference on Concurrency Theory, CONCUR 1991 - Amsterdam, Netherlands|
Duration: 26 Aug 1991 → 29 Aug 1991
Conference number: 2
|Conference||2nd International Conference on Concurrency Theory, CONCUR 1991|
|Period||26/08/91 → 29/08/91|