skip to content
A temporal-logic based compositional proof system for real-time message passing Preview this item
ClosePreview this item
Checking...

A temporal-logic based compositional proof system for real-time message passing

Author: Jozef Hooman; Jennifer Widom
Publisher: Ithaca, N.Y. : Cornell University, Dept. of Computer Science, 1988.
Series: Cornell University.; Department of Computer Science.; Technical report
Edition/Format:   Book : EnglishView all editions and formats
Database:WorldCat
Summary:
We 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  Read more...
Rating:

(not yet rated) 0 with reviews - Be the first.

Subjects
More like this

 

Find a copy in the library

&AllPage.SpinnerRetrieving; Finding libraries that hold this item...

Details

Document Type: Book
All Authors / Contributors: Jozef Hooman; Jennifer Widom
OCLC Number: 20111816
Description: 24 pages : illustrations ; 28 cm.
Series Title: Cornell University.; Department of Computer Science.; Technical report
Responsibility: Jozef Hooman and Jennifer Widom.

Abstract:

We 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.

Reviews

User-contributed reviews
Retrieving GoodReads reviews...
Retrieving DOGObooks reviews...

Tags

Be the first.

Similar Items

Related Subjects:(1)

Confirm this request

You may have already requested this item. Please select Ok if you would like to proceed with this request anyway.

Linked Data


<http://www.worldcat.org/oclc/20111816>
library:oclcnum"20111816"
library:placeOfPublication
library:placeOfPublication
owl:sameAs<info:oclcnum/20111816>
rdf:typeschema:Book
schema:about
schema:about
schema:contributor
schema:creator
schema:datePublished"1988"
schema:description"We 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
schema:exampleOfWork<http://worldcat.org/entity/work/id/372029706>
schema:inLanguage"en"
schema:name"A temporal-logic based compositional proof system for real-time message passing"@en
schema:publisher
schema:url

Content-negotiable representations

Close Window

Please sign in to WorldCat 

Don't have an account? You can easily create a free account.