By Topic

Exploiting partitioned transition relations for efficient symbolic model checking in CTL

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

3 Author(s)
Casar, A. ; Maribor Univ., Slovenia ; Brezocnik, Z. ; Kapus, T.

We present an efficient tool for symbolic state space traversal of finite state machines. Both algorithms for searching reachable states and for model checking in CTL owe their efficiency primarily to the use of partitioned transition relations. Partitioning of the relations is fully automatic

Published in:

European Design and Test Conference, 1996. ED&TC 96. Proceedings

Date of Conference:

11-14 Mar 1996