Modular Completeness for Communication Closed Layers

M.M. Fokkinga; Mannes Poel; Jakob Zwiers

doi:10.1007/3-540-57208-2_5

Modular Completeness for Communication Closed Layers

M.M. Fokkinga, Mannes Poel, Jakob Zwiers

Databases (Former)

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › Academic › peer-review

8 Citations (Scopus)

127 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 language	Undefined
Title of host publication	Proceedings of the 4th International Conference on Concurrency Theory (CONCUR 1993)
Editors	E. Best
Place of Publication	Berlin
Publisher	Springer
Pages	50-65
Number of pages	16
ISBN (Print)	3-540-57208-2
DOIs	https://doi.org/10.1007/3-540-57208-2_5
Publication status	Published - 1993
Event	4th International Conference on Concurrency Theory, CONCUR 1993 - Hildesheim, Germany Duration: 23 Aug 1993 → 26 Aug 1993 Conference number: 4

Publication series

Name	Lecture Notes in Computer Science
Publisher	Springer Verlag
Volume	715

Conference

Conference	4th International Conference on Concurrency Theory, CONCUR 1993
Abbreviated title	CONCUR
Country/Territory	Germany
City	Hildesheim
Period	23/08/93 → 26/08/93

Keywords

EWI-7238
METIS-119271
IR-66436

Access to Document

10.1007/3-540-57208-2_5

Cite this

@inproceedings{44d154026c754e3c8baa51df7dec8c2f,

title = "Modular Completeness for Communication Closed Layers",

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).",

keywords = "EWI-7238, METIS-119271, IR-66436",

author = "M.M. Fokkinga and Mannes Poel and Jakob Zwiers",

note = "Imported from EWI/DB PMS [db-utwente:inpr:0000003411]; null ; Conference date: 23-08-1993 Through 26-08-1993",

year = "1993",

doi = "10.1007/3-540-57208-2_5",

language = "Undefined",

isbn = "3-540-57208-2",

series = "Lecture Notes in Computer Science",

publisher = "Springer",

pages = "50--65",

editor = "E. Best",

booktitle = "Proceedings of the 4th International Conference on Concurrency Theory (CONCUR 1993)",

}

Fokkinga, MM, Poel, M & Zwiers, J 1993, Modular Completeness for Communication Closed Layers. in E Best (ed.), Proceedings of the 4th International Conference on Concurrency Theory (CONCUR 1993)., 10.1007/3-540-57208-2_5, Lecture Notes in Computer Science, vol. 715, Springer, Berlin, pp. 50-65, 4th International Conference on Concurrency Theory, CONCUR 1993, Hildesheim, Germany, 23/08/93. https://doi.org/10.1007/3-540-57208-2_5

Modular Completeness for Communication Closed Layers. / Fokkinga, M.M.; Poel, Mannes; Zwiers, Jakob.

Proceedings of the 4th International Conference on Concurrency Theory (CONCUR 1993). ed. / E. Best. Berlin : Springer, 1993. p. 50-65 10.1007/3-540-57208-2_5 (Lecture Notes in Computer Science; Vol. 715).

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › Academic › peer-review

TY - GEN

T1 - Modular Completeness for Communication Closed Layers

AU - Fokkinga, M.M.

AU - Poel, Mannes

AU - Zwiers, Jakob

N1 - Conference code: 4

PY - 1993

Y1 - 1993

N2 - 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).

AB - 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).

KW - EWI-7238

KW - METIS-119271

KW - IR-66436

U2 - 10.1007/3-540-57208-2_5

DO - 10.1007/3-540-57208-2_5

M3 - Conference contribution

SN - 3-540-57208-2

T3 - Lecture Notes in Computer Science

SP - 50

EP - 65

BT - Proceedings of the 4th International Conference on Concurrency Theory (CONCUR 1993)

A2 - Best, E.

PB - Springer

CY - Berlin

Y2 - 23 August 1993 through 26 August 1993

ER -