Conditional axioms and alpha/beta-calculus in process algebra

J.C.M. Baeten, J.A. Bergstra, J.W. Klop

    Research output: Chapter in Book/Report/Conference proceedingConference contributionAcademic

    54 Downloads (Pure)

    Abstract

    The authors define the alphabet of finite and infinite terms in ACP/sub tau /, the algebra of communicating processes with silent steps, and also give approximations of it. Using the alphabet, they formulate some conditional axioms. The usefulness of the axioms is demonstrated in examples
    Original languageEnglish
    Title of host publicationFormal Description of Programming Concepts III. Proceedings of the IFIP TC 2/WG 2.2 Working Conference, Ebberup, Denmark, 25-28 August, 1986
    EditorsM. Wirsing
    Place of PublicationAmsterdam
    PublisherNorth-Holland Publishing Company
    Pages53-74
    ISBN (Print)0-444-70253-9
    Publication statusPublished - 1987

    Fingerprint

    Dive into the research topics of 'Conditional axioms and alpha/beta-calculus in process algebra'. Together they form a unique fingerprint.

    Cite this