Scheduled System Maintenance:
On May 6th, single article purchases and IEEE account management will be unavailable from 8:00 AM - 12:00 PM ET (12:00 - 16:00 UTC). We apologize for the inconvenience.
By Topic

Global vs. local model checking: a comparison of verification techniques for infinite state systems

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

2 Author(s)
Schuele, T. ; Dept. of Comput. Sci., Kaiserslautern Univ., Germany ; Schneider, K.

Global and local model checking procedures follow radically different paradigms: while global approaches are based on fixpoint computation, local approaches are related to deduction and induction. For the verification finite state systems, this may result in different runtimes. For the verification of infinite state systems, however the differences are far more important. Since most problems are undecidable for such systems, it may be the case that one of the procedures does not terminate. In this paper we compare global and local procedures for model checking p-calculus properties of infinite state systems. In particular we show how they can benefit from each other and present appropriate extensions.

Published in:

Software Engineering and Formal Methods, 2004. SEFM 2004. Proceedings of the Second International Conference on

Date of Conference:

28-30 Sept. 2004