Rate Monotonic Analysis for Real-Time Systems

Sha, Lui; Klein, Mark; Goodenough, John B.

doi:10.1007/978-1-4615-3956-8_5

Cited by 54 publications

(4 citation statements)

References 12 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Analytical methods for analyzing real-time systems also exist, such as the rate-monotonic scheduling theory [22,19,26]. In this method a real-time system is characterized by a set of periodic tasks, each having a period and an execution time.…”

Section: Related Methodsmentioning

confidence: 99%

Selective quantitative analysis and interval model checking: Verifying different facets of a system

Campos

Grumberg

1996

Computer Aided Verification

View full text Add to dashboard Cite

In this work we propose a verification methodology consisting of selective quantitative analysis and interval model checking. Our methods can aid not only in determining if a system works correctly, but also in understanding how well the system works.The selective quantitative algorithms compute minimum and maximum delays over a selected subset of system executions. We use a formula of the linear-time temporal logic LTL in order to select either infinite paths or finite intervals over which the computation is performed. We therefore define two semantics for LTL -over infinite paths and over finite intervals. We show how tableaux for LTL formulas can be used for selecting either paths or intervals and can also be used for model checking formulas interpreted over paths or intervals.We have implemented a tool based on our techniques. To demonstrate the usefulness of our methods we verified a complex distributed real-time system. Several features of this example make it an interesting target for our techniques. It is a system of realistic complexity, its components are existing systems and protocols executing a mixture of multimedia, traditional real-time and non-real time tasks. Also, the distributed nature of the system makes the interaction among its various components much richer. This also makes its analysis more difficult.Out tool were able to analyze the system and verify that the deadlines are met by the design. Moreover, we have been able to identify inefficiencies that caused the response time to increase significantly (about 50%). After changing the design we not only verified that the response time was lower, but were also able to determine the causes for the poor performance of the original model using interval model checking.

show abstract

Section: Related Methodsmentioning

confidence: 99%

Selective quantitative analysis and interval model checking: Verifying different facets of a system

Campos

Grumberg

1996

Computer Aided Verification

View full text Add to dashboard Cite

show abstract

“…These results are summarized by Sha, Klein, and Goodenough [14], and Sha and Goodenough [ 111. Aperiodic task scheduling has been treated in [ 151, synchronization requirements treated in [8,9,13], and mode change requirements treated in [lo].…”

Section: Ihmentioning

confidence: 99%

Fixed priority scheduling periodic tasks with varying execution priority

Harbour

Klein

Lehoczky

[1991] Proceedings Twelfth Real-Time Systems Symposium

106

113

View full text Add to dashboard Cite

Abstract1This paper considers the problem of fixed priority scheduling of periodic tasks where each task's execution priority may vary. Periodic tasks are decomposed into serially executed subtasks. where each subtask is characterized by an execution time and a fixed priority, and is permitted to have a deadline. A method for determining the schedulability of each task is presented along with its theoretical underpinnings. This method can be used to analyze the schedulability of complex task sets which involve interrupts, certain synchronization protocols, nonpreemptible sections and, in general, any mechanism that contributes to a complex priority structure. The method is illustrated with a realistic example.

show abstract

“…A collection of results has been developed that is proving to be very useful and is gaining popularity as a basis for reasoning about the timing behavior of real-time systems. These results are summarized by Sha, Klein, and Goodenough [15], Sha and Goodenough [12] and Lehoczky, et al [6]. Aperiodic task scheduling has been treated in [16], synchronization requirements treated in [9,10,14], and mode change requirements treated in [11].…”

Section: Introductionmentioning

confidence: 99%