Symbolic Model Checking of Hierarchical UML State Machines


Jori Dubrovin and Tommi Junttila. Symbolic model checking of hierarchical UML state machines. Technical Report B23, Helsinki University of Technology, Laboratory for Theoretical Computer Science, Espoo, Finland, December 2007.


A compact symbolic encoding is described for the transition relation of systems modeled with asynchronously executing, hierarchical UML state machines that communicate through message passing and attribute access. This enables the analysis of such systems by symbolic model checking techniques, such as BDD-based model checking and SAT-based bounded model checking. Message reception, completion events, and run-to-completion steps are handled in accordance with the UML specification. The size of the encoding for state machine control logic is linear in the size of the state machine even in the presence of composite states, orthogonal regions, and message deferring. The encoding is implemented for the NuSMV model checker, and preliminary experimental results are presented.


UML semantics, UML state machine, symbolic model checking, verification

Suggested BibTeX entry:

    address = {Espoo, Finland},
    author = {Jori Dubrovin and Tommi Junttila},
    institution = {Helsinki University of Technology, Laboratory for Theoretical Computer Science},
    month = {December},
    number = {B23},
    title = {Symbolic Model Checking of Hierarchical {UML} State Machines},
    type = {Technical Report},
    year = {2007},

PostScript (879 kB)
GZipped PostScript (449 kB)
PDF (223 kB)