A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf
.
Splitting trees and partition refinement in real-time model checking
Proceedings of the 35th Annual Hawaii International Conference on System Sciences
This paper discusses model checking of real-time systems. A novel aspect of our approach is the unconventional approach to deal with 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 often used canonical representations, this representation is tailored for the type of exploration algorithm that we apply, namely an algorithm based on partition refinement.
doi:10.1109/hicss.2002.994478
dblp:conf/hicss/SpelbergT02
fatcat:6xeebkmtarepngtcoigyvf54xa