On proving communication closedness of distributed layers

R.T. Gerth, L. Shrira

Research output: Chapter in Book/Report/Conference proceedingConference contributionAcademicpeer-review

Abstract

The notion of communication closed layer has been introduced as a way to define structured composition of distributed systems. An interesting question is how to verify the closedness of a layer. We formulate a proof rule proving closedness of a distributed layer. The rule is developed as an extension of the Apt, Francez and de Roever proof system for CSP. The extension is proved to be sound and relatively complete.
Original languageEnglish
Title of host publicationFoundations of software technology and theoretical computer science (Proceedings 6th Conference, New Delhi, India, December 18-20, 1986)
EditorsK.S. Nori
Place of PublicationBerlin
PublisherSpringer
Pages330-343
Number of pages14
ISBN (Electronic)978-3-540-47239-1
ISBN (Print)3-540-17179-7, 978-3-540-17179-9
DOIs
Publication statusPublished - 1986

Publication series

NameLecture Notes in Computer Science
Volume241
ISSN (Print)0302-9743

Fingerprint Dive into the research topics of 'On proving communication closedness of distributed layers'. Together they form a unique fingerprint.

Cite this