Modular Completeness for Communication Closed Layers

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.

• Type: Conference
• Year: 1993
• Where: CONCUR
• Authors: Maarten M. Fokkinga, Mannes Poel, Job Zwiers
• Keywords: CCL Rule, Communication Closed Layers, CONCUR 1993, Distributed And Parallel Computing, Simpler Independence Rule