Design and Analysis of Propositional‐Logic Rule‐Based Systems

Albert M. K. Cheng · Real-Time Systems · 2002

Chapter 10 describes the design and timing analysis of propositional-logic rule-based systems. Topics covered include: real-time decision systems, real-time expert systems, EQL language, state space representation, computer-aided design tools, response time analysis problem, finite domains, special form, General Analysis Strategy, synthesis problem, time complexity of scheduling equational rule-based programs, Method of Lagrange Multipliers, specifying termination conditions in Estella, behavioral constraint assertions, syntax and semantics of Estella, specifying Special Forms with Estella, context-free grammar for Estella, Estella-General Analysis Tool, selecting independent rule set, constructing and checking the Dependency Graph, checking compatibility conditions, checking cycle-breaking conditions, quantitative timing analysis algorithms, mutual exclusiveness and compatibility, High-Level Dependency Graph, Special Form A and Algorithm_A, Special Form D and Algorithm_D, and Rule-Dependency Graph.

Read the paper · More papers on PaperTik