Home

About

Advanced Search

Browse by Discipline

Scientific Societies

E-print Alerts

Add E-prints

E-print Network
FAQHELPSITE MAPCONTACT US


  Advanced Search  

 
Symbolic Model Checking with ROBDDs Lecture #14 of Advanced Model Checking
 

Summary: Symbolic Model Checking with ROBDDs
Lecture #14 of Advanced Model Checking
Joost-Pieter Katoen
Lehrstuhl 2: Software Modeling & Verification
E-mail: katoen@cs.rwth-aachen.de
January 10, 2011
c JPK
Advanced model checking
Symbolic representation of transition systems
· let TS = (S, , I, AP, L) be a "large" finite transition system
­ the set of actions is irrelevant here and has been omitted, i.e., S × S
· For n log |S| , let injective function enc : S { 0, 1 }n
­ note: enc(S) = {0, 1}n
is no restriction, as all elements { 0, 1 }n
\ enc(S)
can be treated as the encoding of pseudo states that are unreachable
· Identify the states s S = enc-1
({ 0, 1 }n
) with enc(s) {0, 1}n
· And T S by its characteristic function T : { 0, 1 }n

  

Source: Ábrahám, Erika - Fachgruppe Informatik, Rheinisch Westfälische Technische Hochschule Aachen (RWTH)

 

Collections: Computer Technologies and Information Sciences