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

Author

Nazareth, Derek L.

Author_Institution

Sch. of Bus. Adm., Wisconsin Univ., Milwaukee, WI, USA

Volume

5

Issue

3

fYear

1993

fDate

6/1/1993 12:00:00 AM

Firstpage

402

Lastpage

415

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

Keywords

Petri nets; knowledge based systems; Petri nets; circularity; conflict; domain knowledge; error detection; errors of redundancy; knowledge bases; rule-based system verification; Expert systems; Hardware; Helium; Humans; Information analysis; Knowledge based systems; Mathematical model; Petri nets; Potential well; Redundancy;

fLanguage

English

Journal_Title

Knowledge and Data Engineering, IEEE Transactions on

Publisher

ieee

ISSN

1041-4347

Type

jour

DOI

10.1109/69.224193

Filename

224193