Splitting Trees and Partition Refinement in Real-Time Model Checking

	This Article
	PDF RSS feed
	Share
	Email this Article to a friend
	Bibliographic References
	ASCII Text BibTex RefWorks Procite/RefMan/Endnote
	Add to:
	Digg Furl Spurl Blink Simpy Google Del.icio.us Y!MyWeb
	Search
	Similar Articles Articles by R. Spelberg Articles by W. Toetenel

35th Annual Hawaii International Conference on System Sciences (HICSS'02)-Volume 9

Splitting Trees and Partition Refinement in Real-Time Model Checking (PDF)

Big Island, Hawaii

January 07-January 10

ISBN: 0-7695-1435-9

	ASCII Text	x
	R. Spelberg, W. Toetenel, "Splitting Trees and Partition Refinement in Real-Time Model Checking," Hawaii International Conference on System Sciences, vol. 9, pp. 278, 35th Annual Hawaii International Conference on System Sciences (HICSS'02)-Volume 9, 2002.

	BibTex	x
	@article{ 10.1109/HICSS.2002.994478, author = {R. Spelberg and W. Toetenel}, title = {Splitting Trees and Partition Refinement in Real-Time Model Checking}, journal ={Hawaii International Conference on System Sciences}, volume = {9}, year = {2002}, isbn = {0-7695-1435-9}, pages = {278}, doi = {http://doi.ieeecomputersociety.org/10.1109/HICSS.2002.994478}, publisher = {IEEE Computer Society}, address = {Los Alamitos, CA, USA}, }

	RefWorks Procite/RefMan/Endnote	x
	TY - CONF JO - Hawaii International Conference on System Sciences TI - Splitting Trees and Partition Refinement in Real-Time Model Checking SN - 0-7695-1435-9 SP EP A1 - R. Spelberg, A1 - W. Toetenel, PY - 2002 VL - 9 JA - Hawaii International Conference on System Sciences ER -

R. Spelberg

W. Toetenel

DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/HICSS.2002.994478

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

Peer Review Notice | Give Us Feedback

Usage of this product signifies your acceptance of the Terms of Use.