Scheduling System Verification.
Journal
Tools and Algorithms for Construction and Analysis of Systems, 5th International Conference, TACAS '99, Held as Part of the European Joint Conferences on the Theory and Practice of Software, ETAPS'99, Amsterdam, The Netherlands, March 22-28, 1999, Proceedings
Pages
19-33
Date Issued
1999
Author(s)
Abstract
A formal framework is proposed for the verification of complex realtime systems, modeled as client-server scheduling systems, using the popular model-checking approach. Model-checking is often restricted by the large statespace of complex real-time systems. The scheduling of tasks in such systems can be taken advantage of for model-checking. Our implementation and experiments corroborate the feasibility of such an approach. Wide-applicability, significant state-space reduction, and several scheduling semantics are some of the important features in our theory and implementation. © Springer-Verlag Berlin Heidelberg 1999.
Subjects
Interactive computer systems; Real time systems; Scheduling; Semantics; Client server; Complex real-time systems; Formal framework; Important features; Scheduling semantics; Scheduling systems; State-space reduction; Model checking
Type
conference paper