loading...
Splitting Trees and Partition Refinement in Real-Time Model Checking
Big Island, Hawaii January 07-January 10
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/HICSS.2002.99447835th Annual Hawaii International Conf ...
 This Article 
 
PURCHASE ARTICLE: $0
HTML
 
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
STSSV05This paper dicusses 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.
Citation:
R. Spelberg, W. Toetenel, "Splitting Trees and Partition Refinement in Real-Time Model Checking," hicss, vol. 9, pp.278, 35th Annual Hawaii International Conference on System Sciences (HICSS'02)-Volume 9, 2002
Usage of this product signifies your acceptance of the Terms of Use.