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.
|Title of host publication||Foundations of software technology and theoretical computer science (Proceedings 6th Conference, New Delhi, India, December 18-20, 1986)|
|Place of Publication||Berlin|
|Number of pages||14|
|ISBN (Print)||3-540-17179-7, 978-3-540-17179-9|
|Publication status||Published - 1986|
|Name||Lecture Notes in Computer Science|