George S. Avrunin  Home/Search
Context Related
| umass.edu/pub/techr...UMCS1992069.ps umass.edu/~avrunin/r...sharpening.ps.gz Cached: PS.gz PS PDF This document uses CoBlitz to cache paper downloads. If your firewall is blocking outgoing connections to port 3125, you can use these links to download local copies.
Image Update HelpPS.gz PS PDF From: umass.edu (more) From: umass.edu/~avrunin/recent_pubs... (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: this paper, I show how to modify Corbett's method to obtain sharper bounds. 2. Corbett's method (Update)
Context of citations to this paper: More
...a method for achieving this when the automata representing the tasks are acyclic. Complete details of the method can be found in [1]. Suppose that Task 2 enters state 3 at time s 3 and leaves it at time t 3 . Then it is waiting in state 3 during the interval from s 3 to t 3...
Cited by: More
A Practical Technique for Bounding the Time Between Events.. - Corbett, Avrunin (1993) (Correct)
Active bibliography (related documents): More All
0.2: Identical Tasks and Counter Variables in an Integer.. - James Corbett.. (1993) (Correct)
0.2: Using Integer Programming to Verify General Safety and.. - Corbett, Avrunin (1993) (Correct)
0.1: Verification of safety properties using integer programming.. - Esparza, Melzer (1997) (Correct)
Similar documents based on text: More All
0.1: Towards Scalable Compositional Analysis - Corbett, Avrunin (1994) (Correct)
0.1: Positive Bradford Curves through Sharpening - Finlayson, Drew (1999) (Correct)
0.1: Analyzing Partially-Implemented Real-Time Systems - Avrunin, Corbett, Dillon (1998) (Correct)
BibTeX entry: (Update)
G. S. Avrunin. Sharpening bounds on the time between events in maximally parallel systems. Technical Report 92-69, Department of Computer Science, University of Massachusetts at Amherst, 1992. Available for anonymous ftp on ext.math.umass.edu. http://citeseer.ist.psu.edu/avrunin92sharpening.html More
@techreport{ avrunin92sharpening,
author = "George S. Avrunin",
title = "Sharpening the Bounds on Time Between Events in Maximally Parallel Systems",
number = "UM-CS-1992-069",
month = ",",
year = "1992",
url = "citeseer.ist.psu.edu/avrunin92sharpening.html" }
Citations (may not include all citations):71 Automated analysis of concurrent systems with the constraine.. - Avrunin, Buy et al. - 1991 ACM DBLP
10 Automated Formal Analysis Methods for Concurrent and Real-Ti.. (context) - Corbett - 1992 ACM
9 Integer programming in the analysis of concurrent systems (context) - Avrunin, Buy et al. - 1991 ACM DBLP
1 A method for deriving bounds on the time between events in c.. (context) - Avrunin, Corbett et al. - 1991
Documents on the same site (http://fermivista.math.jussieu.fr/ftp/ftp.cs.umass.edu.html): More
RED: Robust Earliest Deadline Scheduling - Buttazzo, Stankovic (1993) (Correct)
Operating System Issues for Continuous Media - Schulzrinne (1996) (Correct)
Log-Based Receiver-Reliable Multicast for Distributed.. - Holbrook (1995) (Correct)
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC