Verifying safety and deadlock properties of networks of asynchronously communicating processes
Number of Authors: 1
1988 (English)Report (Refereed)
We present a method for specifying and verifying networks of non-deterministic processes that communicate by asynchronous message-passing. The method handles safety and deadlock properties. Networks are specified in an operational manner by transition systems. We say that the specification A implements another specification B if every safety and deadlock property true of A also is true of B. We establish a proof rule for verifying that A implements B in this sense. The proof rule is based on simulation between the states of A and B, and is shown to be complete under the assumption that B is deterministic. We illustrate the method by applying it to the alternating bit protocol.
Place, publisher, year, edition, pages
Kista, Sweden: Swedish Institute of Computer Science , 1988, 1. , 18 p.
SICS Research Report, ISSN 0283-3638 ; R88:20
Computer and Information Science
IdentifiersURN: urn:nbn:se:ri:diva-22189OAI: oai:DiVA.org:ri-22189DiVA: diva2:1041733
Also located in the Proceedings of the 9th International Symposium on Protocol Specification, Testing and Verification, June 1989, Enschede, Holland. Brinksma, Scollo and Vissers, editors, published by North-Holland Press. Original report number R88020.2016-10-312016-10-31