Real-Time Systems, COSC-4301-01, Lecture 18 Stefan Andrei 10/23/2019 COSC-4301-01, Lecture 18
Reminder of the last lecture Model checking of finite-state systems 10/23/2019 COSC-4301-01, Lecture 18
Overview of This Lecture Symbolic model checking of finite-state systems (Ordered) Binary Decision Diagrams 10/23/2019 COSC-4301-01, Lecture 18
Boolean functions 10/23/2019 COSC-4301-01, Lecture 18
Representing boolean functions 10/23/2019 COSC-4301-01, Lecture 18
Binary decision trees 10/23/2019 COSC-4301-01, Lecture 18
Problems 10/23/2019 COSC-4301-01, Lecture 18
Binary decision diagrams (BDDs) 10/23/2019 COSC-4301-01, Lecture 18
Reduction rules 10/23/2019 COSC-4301-01, Lecture 18
Reduction rules (cont) 10/23/2019 COSC-4301-01, Lecture 18
Variable ordering 10/23/2019 COSC-4301-01, Lecture 18
Summary of reduction rules 10/23/2019 COSC-4301-01, Lecture 18
Operations on BDDs 10/23/2019 COSC-4301-01, Lecture 18
Predicates 10/23/2019 COSC-4301-01, Lecture 18
Equivalence of functions 10/23/2019 COSC-4301-01, Lecture 18
Operations 10/23/2019 COSC-4301-01, Lecture 18
Ordered BDDs (OBDDs) 10/23/2019 COSC-4301-01, Lecture 18
Properties of OBBDs 10/23/2019 COSC-4301-01, Lecture 18
Properties of reduced OBBDs 10/23/2019 COSC-4301-01, Lecture 18
Properties of reduced OBBDs (cont) 10/23/2019 COSC-4301-01, Lecture 18
OBBDs and variable ordering 10/23/2019 COSC-4301-01, Lecture 18
Reduction for OBDDs 10/23/2019 COSC-4301-01, Lecture 18
Labeling algorithm Mistake: Label all 0’s with 0. 10/23/2019 COSC-4301-01, Lecture 18
Labeling algorithm 3. If there is a node m with the same variable as n such that l(n)=l(m) and h(n)=h(m), label n with m’s label. 10/23/2019 COSC-4301-01, Lecture 18
Complexity 10/23/2019 COSC-4301-01, Lecture 18
Summary Symbolic model checking of finite-state systems (Ordered) Binary Decision Diagrams Models and modelling (analysis & design models) A model is totality of information to describe the 5 views Methodologies = defines a number of models that can be used to develop a system = Examples (structured methods, OO methods) = Formal notations (OO model = UML) UML = unification of earlier OO modelling languages Design models and code (the models used in the design of a system present an abstract view of it, and an implementation adds enough detail to make these models executable). The software development process (Unified Process) 10/23/2019 COSC-4301-01, Lecture 18
Reading suggestions Chapter 4 of [Cheng; 2002] Chapter 6 of [Huth and Ryan; 2004], where this is: M. Huth and M. Ryan: Logic in Computer Science. Modelling and Reasoning about Systems. Cambridge University Press, 2004, ISBN 978-0521-543101 10/23/2019 COSC-4301-01, Lecture 18
Coming up next Visual formalism, statecharts, and STATEMATE (Chapter 5 of [Cheng; 2002]) 10/23/2019 COSC-4301-01, Lecture 18
Thank you for your attention! Questions? 10/23/2019 COSC-4301-01, Lecture 18