Investigating the Applicability of Petri Nets for Rule-Based System Verification

  • Authors:
  • D. L. Nazareth

  • Affiliations:
  • -

  • Venue:
  • IEEE Transactions on Knowledge and Data Engineering
  • Year:
  • 1993

Quantified Score

Hi-index 0.00

Visualization

Abstract

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.