Splitting trees and partition refinement in real-time model checking

This paper discusses model checking of real-time systems. A novel aspect of our approach is the unconventional approach to representing symbolic state spaces. The representation does not use a canonical form for representing symbolic nodes. Instead it applies an alternative representation based on splitting trees. Unlike common canonical representations, this representation is tailored for the type of exploration algorithm that we apply, namely an algorithm based on partition refinement.