z-logo
Premium
Verification of causal models using petri nets
Author(s) -
Portinale Luigi
Publication year - 1992
Publication title -
international journal of intelligent systems
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 1.291
H-Index - 87
eISSN - 1098-111X
pISSN - 0884-8173
DOI - 10.1002/int.4550070803
Subject(s) - petri net , rotation formalisms in three dimensions , computer science , correctness , reachability , theoretical computer science , semantics (computer science) , process architecture , deadlock , programming language , stochastic petri net , artificial intelligence , mathematics , geometry
Many different approaches, mainly based on logical formalisms, have been proposed for modeling causal knowledge and the inferential mechanisms based on this type of knowledge. In this article we present an alternative approach to this problem in which the semantics of a causal model is provided by adopting Petri nets. We show how this scheme of modeling is powerful enough to capture all crucial aspects of the corresponding causal model, without resorting to very complex structures; indeed, the model is obtained using a particular type of deterministic Petri net. Moreover, a complete formalization of the aspects concerning the correctness of the represented causal model is provided in terms of reachability in the Petri net. We believe that this aspect is very important in the knowledge acquisition phase when precise correctness criteria should be defined and respected in the construction of the model. We analyze some of these criteria and we discuss an algorithm (based on a backward simulation of the net) capable of discovering incorrectness by exploiting analysis tools available for Petri nets and the explicit parallelism of the model. © 1992 John Wiley & Sons, Inc.

This content is not available in your region!

Continue researching here.

Having issues? You can contact us here