Modular Completeness for Communication Closed Layers


Share/Save/Bookmark

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.

[img]
Preview
PDF
250Kb
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
Copyright:© 1993 Springer
Faculty:
Electrical Engineering, Mathematics and Computer Science (EEMCS)
Research Group:
Link to this item:http://purl.utwente.nl/publications/66436
Official URL:http://dx.doi.org/10.1007/3-540-57208-2_5
Export this item as:BibTeX
EndNote
HTML Citation
Reference Manager

 

Repository Staff Only: item control page

Metis ID: 119271