Modular Completeness for Communication Closed Layers

M.M. Fokkinga, Mannes Poel, Jakob Zwiers

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

8 Citations (Scopus)
51 Downloads (Pure)

Abstract

The Communication Closed Layers law is shown to be modular complete for a model related to that of Mazurkiewicz. It is shown that in a modular style of program development the CCL rule cannot be derived from simpler ones. Within a non-modular set-up the CCL rule can be derived however from a simpler independence rule and an analog of the expansion rule for process algebras. Part of this work has been supported by Esprit/BRA Project 6021 (REACT).
Original languageUndefined
Title of host publicationProceedings of the 4th International Conference on Concurrency Theory (CONCUR 1993)
EditorsE. Best
Place of PublicationBerlin
PublisherSpringer
Pages50-65
Number of pages16
ISBN (Print)3-540-57208-2
DOIs
Publication statusPublished - 1993
Event4th International Conference on Concurrency Theory, CONCUR 1993 - Hildesheim, Germany
Duration: 23 Aug 199326 Aug 1993
Conference number: 4

Publication series

NameLecture Notes in Computer Science
PublisherSpringer Verlag
Volume715

Conference

Conference4th International Conference on Concurrency Theory, CONCUR 1993
Abbreviated titleCONCUR
CountryGermany
CityHildesheim
Period23/08/9326/08/93

Keywords

  • EWI-7238
  • METIS-119271
  • IR-66436

Cite this