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

Investigating the applicability of Petri nets for rule-based system verification

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

1 Author(s)
Nazareth, D.L. ; Sch. of Bus. Adm., Wisconsin Univ., Milwaukee, WI, USA

It is suggested that as rule-based system (RBS) technology gains wider acceptance, the need to create and maintain large knowledge bases will assume greater importance. Demonstrating a rule base to be free from error remains one of the obstacles to the adoption of this technology. An approach to RBS verification in which the system is modeled as a Petri net on which error detection is performed is presented. A set of propositions is formulated to locate errors of redundancy, conflict, circularity, and gaps in domain knowledge. Rigorous proofs of these propositions are provided. Difficulties in implementing a Petri net-based verifier and the potential restrictions of the applicability of this approach are discussed

Published in:

Knowledge and Data Engineering, IEEE Transactions on  (Volume:5 ,  Issue: 3 )