2002 · 42 citations · 14 references
ComputingComputer EngineeringComputer ScienceFormal MethodsReal-time SystemsSchedulingDeadline AnalysisProcess AlgebraReal-time SchedulingReal-time Systems DesignSchedulability AnalysisTask ModelsFinite-state ProcessesFunctional Behavior AnalysisReal-time Scheduling AnalysisReal-time SemanticsReal-time Systems VerificationScheduling With DeadlinesTimed Process Algebra
The paper develops a generalized approach to schedulability analysis that is mathematically founded in a process algebra called RTSL. Within RTSL one may describe the functional behavior, timing behavior, timing constraints (or deadlines), and scheduling discipline for real-time systems. The formal semantics of RTSL then allows the reachable state space of finite state systems to be automatically generated and searched for timing exceptions. We provide a generalized schedulability analysis technique to perform this state-based analysis.< <ETX xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">></ETX>
14
Wojciech Penczek · Science of Computer Programming · 1990 · 4K citations
Symbolic model checking: 1020 States and beyond
Jerry R. Burch, E. M. Clarke, Kenneth L. McMillan et al. · Information and Computation · 1992 · 2.7K citations