A complete finite prefix for process algebra

E. Brinksma, R. Langerak

    Research output: Chapter in Book/Report/Conference proceedingConference contributionAcademicpeer-review

    9 Citations (Scopus)

    Abstract

    In this paper we show how to use McMillan’s complete finite prefix approach for process algebra. We present the model of component event structures as a semantics for process algebra, and show how to construct a complete finite prefix for this model. We present a simple adequate order (using an order on process algebra expressions) as an optimization to McMillan’s original algorithm
    Original languageEnglish
    Title of host publicationComputer aided verification : proceedings 11th international conference, CAV '99, Trento, Italy, july 6-10, 1999
    EditorsN. Halbwachs, D. Peled
    PublisherSpringer
    Pages184-195
    ISBN (Print)3-540-66202-2
    DOIs
    Publication statusPublished - 1999

    Publication series

    NameLecture Notes in Computer Science
    Volume1633
    ISSN (Print)0302-9743

    Fingerprint

    Dive into the research topics of 'A complete finite prefix for process algebra'. Together they form a unique fingerprint.

    Cite this