JavaScript is disabled for your browser. Some features of this site may not work without it.
Timed Transition Systems
dc.contributor.author | Henzinger, Thomas A. | en_US |
dc.contributor.author | Manna, Zohar | en_US |
dc.contributor.author | Pnueli, Amir | en_US |
dc.date.accessioned | 2007-04-23T17:57:25Z | |
dc.date.available | 2007-04-23T17:57:25Z | |
dc.date.issued | 1992-01 | en_US |
dc.identifier.citation | http://techreports.library.cornell.edu:8081/Dienst/UI/1.0/Display/cul.cs/TR92-1263 | en_US |
dc.identifier.uri | https://hdl.handle.net/1813/7103 | |
dc.description.abstract | We incorporate time into an interleaving model of concurrency. In timed transition systems, the qualitative fairness requirements of traditional transition system are replaced (and superseded) by quantitative lower-bound and upper-bound timing constraints on transitions. The purpose of this paper is to explore the scope of applicability for the abstract model of timed transition systems. We demonstrate that the model can represent a wide variety of phenomena that routinely occur in conjunction with the timed execution of concurrent processes. Our treatment covers both processes that are executed in parallel on separate processors and communicate either through shared variables or by message passing, and processes that time-share a limited number of processors under a given scheduling policy. Often it is this scheduling policy that determines if a system meets its real-time requirements. Thus we explicitly address such questions as time-outs, interrupts, static and dynamic priorities. | en_US |
dc.format.extent | 2604664 bytes | |
dc.format.extent | 526297 bytes | |
dc.format.mimetype | application/pdf | |
dc.format.mimetype | application/postscript | |
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 | Timed Transition Systems | en_US |
dc.type | technical report | en_US |