Dynamic Scheduling and Fault-Tolerance: Specification andVerification

Authors:
Tomasz Janowski;Mathai Joseph
Affiliations:
The United Nations University, International Institute for Software Technology, P.O. Box 3058, Macau;Tata Research Development and Design Centre, Pune, India
Venue:
Real-Time Systems
Year:
2001

Citing 15
Cited 3

Communication and concurrency

Communication and concurrency
Submodule construction as equation solving in CCS

Theoretical Computer Science
Priorities in process algebras

Information and Computation - Selections from 1988 IEEE symposium on logic in computer science
A resource-based prioritized bisimulation for real-time systems

Information and Computation
Scheduling algorithms for fault-tolerance in hard-real-time systems

Real-Time Systems - Special issue on responsive computer systems
A brief history of Timed CSP

MFPS '92 Selected papers of the meeting on Mathematical foundations of programming semantics
Real-time fault tolerant operation of the 802.5 token ring

Real-Time Systems
CCS with priority choice

Information and Computation
Generality in design and compositional verification using Tav

Formal Methods in System Design
Fault-Tolerant Rate-Monotonic Scheduling

Real-Time Systems
A Process Algebraic Approach to the Schedulability Analysisof Real-Time Systems

Real-Time Systems
Specification and verification of fault-tolerance, timing, and scheduling

ACM Transactions on Programming Languages and Systems (TOPLAS)
The Theory and Practice of Concurrency

The Theory and Practice of Concurrency
On Bisimulation, Fault-Monotonicity and Provable Fault-Tolerance

AMAST '97 Proceedings of the 6th International Conference on Algebraic Methodology and Software Technology
Realizable and Unrealizable Specifications of Reactive Systems

ICALP '89 Proceedings of the 16th International Colloquium on Automata, Languages and Programming

Verifying fault-tolerant Erlang programs

Proceedings of the 2005 ACM SIGPLAN workshop on Erlang
Computing platforms

Embedded Systems Design
Verification of language based fault-tolerance

EUROCAST'05 Proceedings of the 10th international conference on Computer Aided Systems Theory

Quantified Score

Hi-index	0.00

Visualization

Abstract

Considera distributed real-time program which is executed on a systemwith a limited set of hardware resources. Assume the programis required to satisfy some timing constraints, despite the occurrenceof anticipated hardware failures. For efficient use of resources,scheduling decisions must be taken at run-time, considering deadlines,the load and hardware failures. The paper demonstrates how toreason about such dynamically scheduled programs in the frameworkof a timed process algebra and modal logic. The algebra providesa uniform process encoding of programs, hardware and schedulers,with an operational semantics of a process depending on the assumptionsabout faults. The logic specifies the timing properties of aprocess and verifies them via this fault-affected semantics,establishing fault-tolerance. The approach lends itself to applicationof existing tools and results supporting reasoning in processalgebras and modal logics.