1 / 13

Plan

Plan. 1st Lesson: Systems Lacking Specification 2nd Lesson: Controlling the State Space 3rd Lesson: Integrating Expert Knowledge 4th Lesson: Validation and Diagnosis Model Checking Validation of Foldings Error Diagnosis 5th Lesson: Perspectives. Education. Model Checking...

milek
Download Presentation

Plan

An Image/Link below is provided (as is) to download presentation Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author. Content is provided to you AS IS for your information and personal use only. Download presentation by click this link. While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server. During download, if you can't get a presentation, the file might be deleted by the publisher.

E N D

Presentation Transcript

  1. Plan • 1st Lesson:Systems Lacking Specification • 2nd Lesson: Controlling the State Space • 3rd Lesson: Integrating Expert Knowledge • 4th Lesson: Validation and Diagnosis • Model Checking • Validation of Foldings • Error Diagnosis • 5th Lesson: Perspectives

  2. Education Model Checking... is to check whether a semantical structure satisfies a logical formula S i.e. whether the structure is a model for the formula.

  3. & Temporal Logic • some regular properties • mainly bounding behavior from above • decidable satisfiability problem • Examples: • AG ~c : never c • AFb : finally b • ASU ( a |b , c ) : (a or b) until c The World of Model Checking Automata • Mainly: • finitely many states • finite alphabet • nondeterministic • infinite runs a b a c c b

  4. !Nondeterminism! Automaton Behavior The automaton a a b a b c a b c c b c a c unfolds into a tree : b

  5. AF AWU (,) Correct Behavior Incorrect Behavior Logic Interpretation AG Specification

  6. The Algorithmics of Model Checking Model-check problems are closely related to graph problems: AF : M_0 := [ ] M_i+1 := M_i {s|t. sttM_i} M_ = [AF ] AG  : a reachability problem M_0 := [] M_i+1 := M_i \{s|tM_i. st} M_ = [AG]

  7. Structures: Logic: Model Checking Service Logic Graphs Control view of Service Logic Graphs, i.e.: • SIBs as states • Edges as transitions • SIB names as observations (automaton alphabet) • SIB parameters as additional observations Full mu-calculus • universal and existential specifications • forward and backward modalities • first order extensions referencing SIB parameters

  8. Model Checking:Example 1 • start • startTestCase • upnOffHook • upnCheckDisplay • passed • upnOnHook • end

  9. Counter example Model Checking: Example 1 • start • startTestCase • upnOffHook start => AF(passed  failed) • upnCheckDisplay • passed • upnOnHook • end

  10. start • startTestCase • upnOffHook • upnCheckDisplay • failed • end • passed • upnCheckLed • passed • end • failed • end Model Checking: Example 2

  11. start • startTestCase • upnOffHook • upnCheckDisplay • failed • end • passed Counter example • upnCheckLed • passed • end • failed • end Model Checking: Example 2 (passed  failed) => AX AG(passed & failed)

  12. Model Checking: Example 3 n. upnOffHook(n)  AFupnOnHook(n) • start • startTestCase • upnOffHook_DevB • upnCheckDisplay_DevB • passed • failed • upnOnHook_DevA • end

  13. upnOffHook_DevB  AFupnOnHook_DevB & upnOffHook_DevA  AFupnOnHook_DevA Model Checking: Example 3 • start • startTestCase n. upnOffHook(n)  AFupnOnHook(n) • upnOffHook_DevB • upnCheckDisplay_DevB • passed • failed • upnOnHook_DevA • end

More Related