Summary: Zone-Based Reachability Analysis
Lecture #19 of Advanced Model Checking
Joost-Pieter Katoen
Lehrstuhl 2: Software Modeling & Verification
E-mail: katoen@cs.rwth-aachen.de
January 25, 2011
c JPK
Advanced model checking
TCTL model checking
· Model checking timed automata against TCTL is decidable
­ example TCTL-formula: 3 10
goal
· Key ingredient for decidability: finite quotient wrt. a bisimulation
­ bisimulation = equivalence on clock valuations
­ equivalence classes are called regions
· Region automaton is highly impractical for tool implementation
­ the number of regions lies in (|C|!·
Q
xC
cx)

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

Collections: Computer Technologies and Information Sciences