Some finite-graph models for process algebra


Share/Save/Bookmark

Spruit, Paul and Wieringa, Roel (1991) Some finite-graph models for process algebra. In: 2nd International Conference on Concurrency Theory, CONCUR 1991, 26-29 August 1991, Amsterdam, The Netherlands (pp. pp. 495-509).

open access
[img]
Preview
PDF
841kB
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.
Item Type:Conference or Workshop Item
Copyright:© 1991 Springer
Link to this item:http://purl.utwente.nl/publications/76214
Official URL:http://dx.doi.org/10.1007/3-540-54430-5_109
Export this item as:BibTeX
EndNote
HTML Citation
Reference Manager

 

Repository Staff Only: item control page