×

Verification of causal models using Petri nets. (English) Zbl 0794.68152

Summary: 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 analyse 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.

MSC:

68T30 Knowledge representation
68Q85 Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.)
PDFBibTeX XMLCite
Full Text: DOI

References:

[1] Steels, Future Generation Computer Systems 1 pp 213– (1985)
[2] IEEE Trans. on Systems, Man and Cybernetics SMC-17 (1987)
[3] Geissman, AI Expert 3 pp 26– (1988)
[4] and , ”Verification and validation of expert systems,” In Proc. WESTEX 87, Anaheim, CA, 1987, pp. 38–43.
[5] Landau, International Journal of Man-Machine Studies 26 pp 617– (1987)
[6] Cragun, International Journal of Man-Machine Studies 26 pp 633– (1987)
[7] , and , ”Completeness and consistency in a rule-based system,” In Rule-Based Expert System, and (eds.), Addison-Wesley, 1984.
[8] , , and , ”Checking an expert system knowledge base for consistency and completeness,” In Proc. IJCAI 85, Los Angeles, CA, (1985), pp. 375–378.
[9] Petri Net Theory and the Modeling of Systems, Prentice-Hall, 1981.
[10] Kommunication mit Automaten, Ph.D. Dissertation, University of Bonn, 1962.
[11] Deng, IEEE Trans. on Knowledge and Data Engineering KDE-2 pp 295– (1990)
[12] Giordana, Information Sciences 35 pp 1– (1985)
[13] ”A new method to checking rule bases for inconsistency,” In Proc. ECAI 90, Stockholm, 1990, pp. 437–442.
[14] ”Detection d’incoherences et d’incompletudes dans les bases des regles: le systeme INDE” (in French), In Proc. 8th Intern. Workshop on Expert Systems and their Applications, Avignon, 1988, pp. 15–33.
[15] and , Diagnostic Problem Solving: Combining Heuristic, Approximate and Causal Reasoning, Van Nostrand Reinhold, 1989.
[16] Console, Computers and Artificial Intelligence 8 pp 323– (1989)
[17] Console, International Journal of Intelligent Systems 5 pp 83– (1990)
[18] Peterson, Journal of Computer and System Science 13 pp 1– (1976) · Zbl 0354.68100 · doi:10.1016/S0022-0000(76)80047-5
[19] and , ”Petri nets: Basic notions, structure, behavior,” Lecture Notes in Computer Science 224, , and (Eds.), Springer Verlag, 1985, pp. 585–668.
[20] ”Elementary net systems,” Lecture Notes in Computer Science 254, , and (Eds.), Springer Verlag, 1986, pp. 26–59.
[21] and , ”A note on D-continuos causal nets,” Applications and Theory of Petri Nets, and (Eds.), Springer Verlag, 1983, pp. 86–97. · doi:10.1007/978-3-642-69028-0_7
[22] Nielsen, Theoretical Computer Sciences 13 pp 81– (1981) · Zbl 0452.68067 · doi:10.1016/0304-3975(81)90112-2
[23] ”Non-sequential processes,” Internal Report GMD-ISF-77-05, Bonn, 1977.
[24] Coordination of Asynchronous Events, Ph.D. Dissertation, Dept. of Electr. Eng., MIT, Cambridge, MA, 1970.
[25] and , ”Using Petri nets in diagnostic reasoning,” In Proc. 13th World Congress on Computation and Applied Mathematics-IMACS 91, Dublin, 1991, pp. 1400–1403.
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. In some cases that data have been complemented/enhanced by data from zbMATH Open. This attempts to reflect the references listed in the original paper as accurately as possible without claiming completeness or a perfect matching.