Some finite-graph models for Process Algebra

Jos C.M. Baeten; Paul Spruit; Jan Frisco Groote; Roelf J. Wieringa

doi:10.1007/3-540-54430-5_109

Some finite-graph models for Process Algebra

Jos C.M. Baeten (Editor), Paul Spruit, Jan Frisco Groote (Editor), Roelf J. Wieringa

Research output: Contribution to conference › Paper › peer-review

156 Downloads (Pure)

Abstract

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.

Original language	Undefined
Pages	495-509
Number of pages	15
DOIs	https://doi.org/10.1007/3-540-54430-5_109
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

Conference	2nd International Conference on Concurrency Theory, CONCUR 1991
Abbreviated title	CONCUR
Country/Territory	Netherlands
City	Amsterdam
Period	26/08/91 → 29/08/91

Keywords

EWI-10671
IR-76214
SCS-Services

Access to Document

10.1007/3-540-54430-5_109

Cite this

@conference{d1a48b96f6824a8fbb848d8b670a6062,

title = "Some finite-graph models for Process Algebra",

abstract = "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.",

keywords = "EWI-10671, IR-76214, SCS-Services",

author = "Baeten, {Jos C.M.} and Paul Spruit and Groote, {Jan Frisco} and Wieringa, {Roelf J.}",

year = "1991",

month = aug,

doi = "10.1007/3-540-54430-5_109",

language = "Undefined",

pages = "495--509",

note = "2nd International Conference on Concurrency Theory, CONCUR 1991 ; Conference date: 26-08-1991 Through 29-08-1991",

}

TY - CONF

T1 - Some finite-graph models for Process Algebra

AU - Spruit, Paul

AU - Wieringa, Roelf J.

A2 - Baeten, Jos C.M.

A2 - Groote, Jan Frisco

N1 - Conference code: 2

PY - 1991/8

Y1 - 1991/8

N2 - 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.

AB - 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.

KW - EWI-10671

KW - IR-76214

KW - SCS-Services

U2 - 10.1007/3-540-54430-5_109

DO - 10.1007/3-540-54430-5_109

M3 - Paper

SP - 495

EP - 509

T2 - 2nd International Conference on Concurrency Theory, CONCUR 1991

Y2 - 26 August 1991 through 29 August 1991

ER -