Modular completeness for Communication Closed Layers

  • Maarten Fokkinga
  • Mannes Poel
  • Job Zwiers
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 715)

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.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. [CG88]
    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.Google Scholar
  2. [EF82]
    Elrad and N. Francez. Decomposition of distributed programs into communication closed layers. Science of Computer Programming, 2, 1982.Google Scholar
  3. [GHS83]
    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.CrossRefGoogle Scholar
  4. [Gis84]
    J. L. Gischer. Partial Orders and the Axiomatic Theory of Shuffle. PhD thesis, Stanford University, 1984.Google Scholar
  5. [JPSZ91]
    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.Google Scholar
  6. [JPZ91]
    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.Google Scholar
  7. [JPZ93]
    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.Google Scholar
  8. [JZ92a]
    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.Google Scholar
  9. [JZ92b]
    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.Google Scholar
  10. [KP87]
    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.Google Scholar
  11. [KP89]
    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.Google Scholar
  12. [KP90]
    S. Katz and D. Peled. Interleaving set temporal logic. Theoretical Computer Science, 75(2), 1990.Google Scholar
  13. [KP92]
    S. Katz and D. Peled. Verification of distributed programs using representative interleaving sequences. Distributed Computing, 6(2), 1992.Google Scholar
  14. [Maz89]
    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.Google Scholar
  15. [Mil80]
    R. Milner. A Calculus of Communicating Systems, volume 92 of Lecture Notes in Computer Science. Springer-Verlag, 1980.Google Scholar
  16. [PZ92]
    M. Poel and J. Zwiers. Layering techniques for development of parallel systems. In Proc. CAV, 1992.Google Scholar
  17. [PZ93a]
    M. Poel and J. Zwiers. Closed layers in the presence of conspiracy and cascading. 1993.Google Scholar
  18. [PZ93b]
    M. Poel and J. Zwiers. Modular completeness for communication closed layers. Technical report, University of Twente, 1993.Google Scholar
  19. [SdR89]
    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.Google Scholar
  20. [VTL82]
    J. Valdes, R.E. Tarjan, and E.L. Lawler. The recognition of series parallel digraphs. SIAM Journal of Computing, 2(11):298–313, 1982.CrossRefGoogle Scholar
  21. [Zwi89]
    J. Zwiers. Compositionality, Concurrency and Partial Correctness. Springer LNCS 321, 1989.Google Scholar
  22. [Zwi91]
    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.Google Scholar

Copyright information

© Springer-Verlag 1993

Authors and Affiliations

  • Maarten Fokkinga
    • 1
  • Mannes Poel
    • 1
  • Job Zwiers
    • 1
  1. 1.Department of Computer ScienceUniversity of TwenteAE EnschedeThe Netherlands

Personalised recommendations