Real-Time Systems: Scheduling, Analysis, and Verification (Google eBook)
The first book to provide a comprehensive overview of the subject rather than a collection of papers.
What people are saying - Write a review
3 REALTIME SCHEDULING AND SCHEDULABILITY ANALYSIS
4 MODEL CHECKING OF FINITESTATE SYSTEMS
5 VISUAL FORMALISM STATECHARTS AND STATEMATE
6 REALTIME LOGIC GRAPHTHEORETIC ANALYSIS AND MODECHART
7 VERIFICATION USING TIMED AUTOMATA
8 TIMED PETRI NETS
ACSR actions algorithm analyze assigned automata automaton BDDs behavior bisimulation Boolean checking Cheng clause clock computation condition element constraints corresponding cycle deadline denote described determine edge enabling condition EQL program EQL(B equivalent Estella example execution exists expert system false first-order logic fixed point function GPIp implementation initial input integer labeled language matching WMEs maximal number Modechart model checker modify mutually exclusive node number of rule operator OPS5 program optimization periodic tasks Petri nets predicate logic process algebra propositional logic reach a fixed reachable real-time systems response-time Rete network rule firings rule-based program rule-based systems safety assertion satisfy semantic semantic tree sensor sequence set of rules special form specification sporadic tasks state-space graph Statecharts subrule subset symbol task set techniques temporal logic termination tokens transition relation transition table true upper bound values variables verification vertex WMEs writeln(stdout
Page 11 - A literal is an atomic formula or the negation of an atomic formula, and we refer to these as being positive or negative, respectively.
Page 501 - W. Zhao, K. Ramamritham, and J. Stankovic, "Scheduling Tasks with Resource Requirements in Hard Real-Time Systems," IEEE Transactions on Software Engineering, May 1987.
Page 493 - CY Park and AC Shaw, Experiments with a Program Timing Tool Based on Source-Level Timing Schema, IEEE Computer, May 1991, 48-56.