Protocol design by layered decomposition a compositional approach

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 571 LNCS, Issue , 1991, Pages 307-326

  Janssen, Wil ^a   Zwiers, Job ^a  

^a UNIVERSITY OF TWENTE   (Netherlands)

Author keywords

[No Author keywords available]

Indexed keywords

ALGEBRA; FAULT TOLERANCE;

ALGEBRAIC TRANSFORMATIONS; DESIGN PRINCIPLES; INITIAL DESIGN; LOGICAL STRUCTURE; PHYSICAL STRUCTURES; PROTOCOL DESIGN; TWO PHASE COMMIT PROTOCOLS;

REAL TIME SYSTEMS;

EID: 70350650536     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-55092-5_17     Document Type: Conference Paper

References (18)

1. K.R. Apt, E.-R. Olderog, Verification of sequential and concurrent programs, Springer, 1991.
2. P.A. Bernstein, V. Hadzilacos and N. Goodman, Concurrency Control and Recovery in Database Systems, Addison-Wesley, 1987.
3. K.M. Chandy and J. Misra, Parallel Program Design: A Foundation, Addison-Wesley, 1988.
4. F. Critian, H. Aghili, R. Strong, D. Dolev, Atomic Broadcast: From Simple Message Diffusion to Byzantine Agreement, Proceedings 15th International Symposium on Fault-Tolerant Computing, 1985.
5. T. Elrad and N. Francez, Decomposition of distributed programs into communication closed layers, Science of Computer Programming 2, 1982.
6. R.T. Gallager, P.A. Humblet and P.M. Spira, A distributed algorithm for minimum-weight spanning trees, ACM TOPLAS 5-1, 1983.
7. R. J. van Glabbeek and U. Goltz, Equivalence Notions for Concurrent Systems and Refinement of Actions, Arbeitspapiere der GMD, Number 366, GMD, 1989.
8. J. Hooman, Specification and Compositional Verification of Real-Time Systems, Ph.D. Thesis, Eindhoven University of Technology, 1991.
9. W. Janssen, M. Poel and J. Zwiers, Consistent alternatives of parallelism with conflicts, Memorandum INF-91-15, University of Twente.
10. W. Janssen, M. Poel and J. Zwiers, Action Systems and Action Refinement in the Development of Parallel Systems, an Algebraic Approach, proceedings CONCUR '91, Springer LNCS 527, 1991.
11. W. Janssen, M. Poel, K. Sikkel, and J. Zwiers, The Primordial Soup Algorithm, A Systematic Approach to the Specification and Design of Parallel Parsers, Proceedings Computing Science in the Netherlands Conference, 1991.
12. L. Lamport, The Hoare Logic of concurrent programs, Acta Informatica 14, 1980.
13. S. Owicki and D. Gries, An axiomatic proof technique for parallel programs, Acta Informatica 6, 1976.
14. V. Pratt, Modelling Concurrency with Partial orders, International Journal of Parallel Programming 15, 1986, pp. 33-71.
15. M. Raynal, Distributed Algorithms and Protocols, John Wiley & Sons, 1988.
16. A. Segall, Distributed Network Protocols, IEEE Transactions on Information Theory, Vol. IT-29, 1983, pp. 23-35.
17. F.A. Stomp and W.P. de Roever, Designing distributed algorithms by means of formal sequentially phased reasoning, Proc. of the 3rd International Workshop on Distributed Algorithms, Nice, LNCS 392, Eds. J.-C. Bermond and M. Raynal, 1989, pp. 242-253.
18. J. Zwiers and W.P. de Roever, Predicates are Predicate Transformers: a unified theory for concurrency, Proc. of the conference on Principles of Distributed Computing, 1989.