Analysis of Approximate Petri Nets by Means of Occurrence Graphs

• Autorzy: Suraj Z. , Fryc B.
• Języki publikacji: EN

Abstrakty

EN

Approximate Petri nets (AP-nets) can be used for the knowledge representation and approximate reasoning. The AP-net model is defined on the basis of the rough set approach, fuzzy Petri nets and coloured Petri nets. One of the main advantages of AP-net model is a possibility to present the reachability set of a given AP-net by means of an occurrence graph. Such graphs can serve, among others, for analyzing and evaluating an approximate reasoning realized by using AP-net model. The main contribution of the paper is to present the algorithms for construction and analysis of occurrence graphs for the AP-nets, especially in the context of searching for the best decision and finding the shortest distance in order to compute such decision. This approach can be applied to the design and analysis of the formal models for expert systems, control systems, communication systems, etc.

Słowa kluczowe

EN

approximate Petri nets; approximate reasoning; knowledge representation; occurrence graphs

• Wydawca: IOS Press
• Czasopismo: Fundamenta Informaticae
• Rocznik: 2007
• Tom: Vol. 79, nr 3-4
• Strony: 541--551
• Opis fizyczny: bibliogr. 11 poz., tab., wykr.

Twórcy

autor

Suraj Z.

autor

Fryc B.

• Chair of Computer Sciecne Foundations, University of Information Technology and Managememnt, Rzeszów, Poland,

Bibliografia

• [1] Chen, S.-M., Ke, J.-S., Chang, J.-F.: Knowledge Representation Using Fuzzy Petri Nets. IEEE Transactions on Knowledge and Data Engineering, Vol. 2, No. 3, 1990, pp. 311-319.
• [2] Cormen,T. H., Leiserson, Ch. E., Rivest, R. L.: Introduction to Algorithms, The Massachusetts Institute of Technology Thirteenth printing, 1994.
• [3] Fryc, B., Pancerz, K., Suraj, Z.: Approximate Petri Nets for Rule-Based Decision Making, in: S. Tsumoto et al. (Eds.), Proceedings of the 4th International Conference on Rough Sets and Current Trends in Computing, Uppsala, Sweden, June 1-5, Lecture Notes in Artificial Intelligence Vol. 3066, Springer-Verlag, Berlin, 2004, pp. 733-742.
• [4] Huber, P., Jensen, A.M, Jensen, L.O, Jensen, K.: Reachability Trees for High-level Petri Nets. Theoretical Computer Science 45 (1986), North-Holland, 261-292.
• [5] Jensen, K.: Coloured Petri Nets. Basic Concepts, Analysis Methods and Practical Use. Vol.1, Springer, Berlin, 1992.
• [6] Jensen, K.: Coloured Petri Nets. Basic Concepts, Analysis Methods and Practical Use. Vol.2, Springer, Berlin, 1995.
• [7] Looney, C.G.: Fuzzy Petri Nets for Rule-Based Decision-making. IEEE Transactions on Systems, Man, and Cybernetics, 1988, pp. 178-183.
• [8] Pawlak, Z.: Rough Sets - Theoretical Aspects of Reasoning About Data. Kluwer Academic Publishers, Dordrecht, 1991.
• [9] Valmari, A.: Stubborn Sets for Reduced State Space Generation. In: G. Rozenberg (ed.): Advences in Petri Nets 1990, Lectue Notes in Computer Science Vol. 483, Springer-Verlag 1991, 491-515.
• [10] Skowron, A., Suraj, Z.: A Parallel Algorithm for Real-Time Decision Making: A Rough Set Approach. Journal of Intelligent Information Systems 7, Kluwer Academic Publishers, Dordrecht, 1996, pp.5-28.
• [11] Zadeh, L. A., Fuzzy Sets as a Basis for a Theory of Possibility, Fuzzy Sets and Systems, Vol. 1, No. 1, 1978, pp. 328.