Modular Completeness for Communication Closed Layers


Fokkinga, Maarten and Poel, Mannes and Zwiers, Job (1993) Modular Completeness for Communication Closed Layers. In: 4th International Conference on Concurrency Theory, CONCUR, 23-26 Aug 1993, Hildesheim, Germany (pp. pp. 50-65).

open access
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).
Item Type:Conference or Workshop Item
Additional information:Imported from EWI/DB PMS [db-utwente:inpr:0000003411]
Copyright:© 1993 Springer
Electrical Engineering, Mathematics and Computer Science (EEMCS)
Research Group:
Link to this item:
Official URL:
Export this item as:BibTeX
HTML Citation
Reference Manager


Repository Staff Only: item control page

Metis ID: 119271