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).
The authors thank Wil Janssen for carefully reading the manuscript.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
C. Chou and E. Gafni. Understanding and verifying distributed algorithms using stratified decomposition. In Proc. 7th ACM Symposium on Principles of Distributed Computing. ACM, 1988.
Elrad and N. Francez. Decomposition of distributed programs into communication closed layers. Science of Computer Programming, 2, 1982.
R.T. Gallager, P.A. Humblet, and P.M. Spira. A distributed algorithm for minimum-weight spanning trees. ACM TOPLAS, 5(1):66–77, Jan 1983.
J. L. Gischer. Partial Orders and the Axiomatic Theory of Shuffle. PhD thesis, Stanford University, 1984.
W. Janssen, M. Poel, K. Sikkel, and J. Zwiers. The primordial soup algorithm: A systematic approach to the specification and design of parallel parsers. In Proc. Computing Science in the Netherlands, pages 298–314, 1991.
W. Janssen, M. Poel, and J. Zwiers. Action systems and action refinement in the development of parallel systems. In Proc. of CONCUR '91, pages 298–316. Springer-Verlag, LNCS 527, 1991.
W. Janssen, M. Poel, and J. Zwiers. Action systems and action refinement in the development of parallel systems. Technical Report 93-14, University of Twente, 1993.
W. Janssen and J. Zwiers. From sequential layers to distributed processes, deriving a distributed minimum weight spanning tree algorithm, (extended abstract). In Proc. 11th ACM Symposium on Principles of Distributed Computing, pages 215–227. ACM, 1992.
W. Janssen and J. Zwiers. Protocol design by layered decomposition, a compositional approach. In J.Vytopil, editor, Proc. Formal Techniques in Real-Time and Fault-Tolerant Systems, pages 307–326. Springer-Verlag, LNCS 571, 1992.
S. Katz and D. Peled. Interleaving set temporal logic. In Proc. of the 6th ACM Symposium on Principles of Distributed Computing, Vancouver, pages 178–190, 1987.
S. Katz and D. Peled. An efficient verification method for parallel and distributed programs. In Proc. of the REX workshop on Linear Time, Branching Time and Partial order in Logics and Models for Concurrency, Noordwijkerhout, Springer LNCS 354, pages 489–507. Springer-Verlag, 1989.
S. Katz and D. Peled. Interleaving set temporal logic. Theoretical Computer Science, 75(2), 1990.
S. Katz and D. Peled. Verification of distributed programs using representative interleaving sequences. Distributed Computing, 6(2), 1992.
A. Mazurkiewicz. Basic notions of trace theory. In J.W. de Bakker, W.-P. de Roever, and G. Rozenberg, editors, Proc. of the REX workshop on Linear Time, Branching Time and Partial order in Logics and Models for Concurrency, Noordwijkerhout 1988, Springer LNCS 354, pages 285–363, 1989.
R. Milner. A Calculus of Communicating Systems, volume 92 of Lecture Notes in Computer Science. Springer-Verlag, 1980.
M. Poel and J. Zwiers. Layering techniques for development of parallel systems. In Proc. CAV, 1992.
M. Poel and J. Zwiers. Closed layers in the presence of conspiracy and cascading. 1993.
M. Poel and J. Zwiers. Modular completeness for communication closed layers. Technical report, University of Twente, 1993.
F.A. Stomp and W.P. de Roever. Designing distributed algorithms by means of formal sequentially phased reasoning. In J.-C. Bermond and M. Raynal, editors, Proc. of the 3rd International Workshop on Distributed Algorithms, Nice, LNCS 392, pages 242–253. Springer-Verlag, 1989.
J. Valdes, R.E. Tarjan, and E.L. Lawler. The recognition of series parallel digraphs. SIAM Journal of Computing, 2(11):298–313, 1982.
J. Zwiers. Compositionality, Concurrency and Partial Correctness. Springer LNCS 321, 1989.
J. Zwiers. Layering and action refinement for timed systems. In Proc. of the REX Workshop on Real Time: Theory and Practice, Mook, the Netherlands, June 3–7 1991. Springer-Verlag.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1993 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Fokkinga, M., Poel, M., Zwiers, J. (1993). Modular completeness for Communication Closed Layers. In: Best, E. (eds) CONCUR'93. CONCUR 1993. Lecture Notes in Computer Science, vol 715. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-57208-2_5
Download citation
DOI: https://doi.org/10.1007/3-540-57208-2_5
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-57208-4
Online ISBN: 978-3-540-47968-0
eBook Packages: Springer Book Archive