Show simple item record

dc.contributor.authorRicciardi, Aleta M.en_US
dc.date.accessioned2007-04-23T17:39:30Z
dc.date.available2007-04-23T17:39:30Z
dc.date.issued1989-11en_US
dc.identifier.citationhttp://techreports.library.cornell.edu:8081/Dienst/UI/1.0/Display/cul.cs/TR89-1052en_US
dc.identifier.urihttps://hdl.handle.net/1813/6852
dc.description.abstractIn this paper, we define a variant of temporal logic that is designed to capture the temporal and causal aspects of asynchronous distributed systems. In these systems, the usual physical concept of time based upon the notion of a global clock is relegated to a secondary role; causal dependency or necessary temporal precedence is fundamental. Causal dependence is just temporal order locally; globally it is based on communication. An instant of time is replaced by a consistent cut. The semantics of most temporal logics have been based on computation sequences, either linear or branching time. In these models, one views an execution of a system as a single sequence of events. In such models, a "spurious" linearization is introduced, effectively disregarding concurrency. Recently, however, partially ordered models have been considered because, it is argued, that they more accurately represent the system being studied. The main technical contribution of this paper is to show that such a logic is complete for the class of models defined by executions of asynchronous systems.en_US
dc.format.extent1784689 bytes
dc.format.extent421588 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.titleCompleteness of a Temporal Logic for Asynchronous Systemsen_US
dc.typetechnical reporten_US


Files in this item

Thumbnail
Thumbnail

This item appears in the following Collection(s)

Show simple item record

Statistics