The Incompleteness of Misra and Chandy's Proof Systems

Collections
Computer Science Technical Reports
Author
Nguyen, Van Long
Abstract

In this paper we show that Misra and Chandy's proof systems for networks of communicating processes ([1, 2]) are incomplete.

Date Issued
1984-09
Publisher
Cornell University
Keywords
•
Previously Published as
http://techreports.library.cornell.edu:8081/Dienst/UI/1.0/Display/cul.cs/TR84-634
Type
technical report