Show simple item record

dc.contributor.authorHooman, Jozefen_US
dc.contributor.authorWidom, Jenniferen_US
dc.date.accessioned2007-04-23T17:33:02Z
dc.date.available2007-04-23T17:33:02Z
dc.date.issued1988-06en_US
dc.identifier.citationhttp://techreports.library.cornell.edu:8081/Dienst/UI/1.0/Display/cul.cs/TR88-919en_US
dc.identifier.urihttps://hdl.handle.net/1813/6759
dc.description.abstractWe consider a model of real-time network computation in which synchronous communication events occur during (possibly overlapping) intervals along a dense time scale. A specification language for processes and networks based on real-time temporal logic is defined. We give a simple proof system for network specifications when specifications for component processes are given. The proof system is then extended for a version of real-time CSP, under the assumption that all communications take some fixed length of time. Finally, it is shown that this proof system can be modified to allow varying communication lengths. All versions of the proof system are compositional, sound, and relatively complete.en_US
dc.format.extent1849678 bytes
dc.format.extent508816 bytes
dc.format.mimetypeapplication/pdf
dc.format.mimetypeapplication/postscript
dc.language.isoen_USen_US
dc.publisherCornell Universityen_US
dc.subjectcomputer scienceen_US
dc.subjecttechnical reporten_US
dc.titleA Temporal-Logic Based Compositional Proof System for Real-Time Message Passingen_US
dc.typetechnical reporten_US


Files in this item

Thumbnail
Thumbnail

This item appears in the following Collection(s)

Show simple item record

Statistics