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 conferencePaperAcademicpeer-review

    57 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 languageUndefined
    Pages495-509
    Number of pages15
    DOIs
    Publication statusPublished - Aug 1991
    Event2nd International Conference on Concurrency Theory, CONCUR 1991 - Amsterdam, Netherlands
    Duration: 26 Aug 199129 Aug 1991
    Conference number: 2

    Conference

    Conference2nd International Conference on Concurrency Theory, CONCUR 1991
    Abbreviated titleCONCUR
    CountryNetherlands
    CityAmsterdam
    Period26/08/9129/08/91

    Keywords

    • EWI-10671
    • IR-76214
    • SCS-Services

    Cite this