A Model and Temporal Proof System for Networks of Processes
| dc.contributor.author | Nguyen, Van Long | en_US |
| dc.contributor.author | Gries, David | en_US |
| dc.contributor.author | Owicki, Susan S. | en_US |
| dc.date.accessioned | 2007-04-23T16:54:06Z | |
| dc.date.available | 2007-04-23T16:54:06Z | |
| dc.date.issued | 1984-11 | en_US |
| dc.description.abstract | A model and a sound and complete proof system for networks of processes in which component processes communicate exclusively through messages is given. The model, an extension of the trace model, can desribe both synchronous and asynchronous networks. The proof system uses temporal-logic assertions on sequences of observations - a generalization of traces. The use of observations (traces) makes the proof system simple, compositional and modular, since internal details can be hidden. The expressive power of temporal logic makes it possible to prove temporal properties (safety, liveness, precedence, etc.) in the system. The proof system is language-independent and works for both synchronous and asynchronous networks. | en_US |
| dc.format.extent | 2404022 bytes | |
| dc.format.extent | 1134477 bytes | |
| dc.format.mimetype | application/pdf | |
| dc.format.mimetype | application/postscript | |
| dc.identifier.citation | http://techreports.library.cornell.edu:8081/Dienst/UI/1.0/Display/cul.cs/TR84-651 | en_US |
| dc.identifier.uri | https://hdl.handle.net/1813/6489 | |
| dc.language.iso | en_US | en_US |
| dc.publisher | Cornell University | en_US |
| dc.subject | computer science | en_US |
| dc.subject | technical report | en_US |
| dc.title | A Model and Temporal Proof System for Networks of Processes | en_US |
| dc.type | technical report | en_US |