Synthesis of Petri Net Models: A Rough Set Approach

• Autorzy: Pancerz K. , Suraj Z.
• Języki publikacji: EN

Abstrakty

EN

The synthesis problem of concurrent data models from experimental tables based on rough set approach has earlier been discussed [14], [15]. Classical Petri nets have been used as a model for concurrency. In this paper we propose the nets with inhibitor expressions and Coloured Petri Nets as models for concurrency. The nets with inhibitor expressions are defined on the base of so called inhibitor rules extracted from modelled systems. The approach presented in this paper enables to implement the algorithms for easier construction of Petri net models. The proposed approach can be applied to discover data models in semi-automatic way. The obtained models enable us to determine all global states of a modelled system represented by an information system, consistent with all rules extracted from the given information system.

Słowa kluczowe

EN

information systems; rough sets; concurrency; nets with inhibitor expressions; coloured Petri nets

• Wydawca: IOS Press
• Czasopismo: Fundamenta Informaticae
• Rocznik: 2003
• Tom: Vol. 55, nr 2
• Strony: 149--165
• Opis fizyczny: bibliogr. 18 poz.

Twórcy

autor

Pancerz K.

autor

Suraj Z.

• Chair of Foundations of Computer Science, University of Information Technology and Management, H.Sucharskiego 2, 35-225 Rzeszów, Poland,

Bibliografia

• [1] Jensen, K.: Coloured Petri Nets. Basic Concepts, Analysis Methods and Practical Use. Vol. 1. Springer-Verlag, Berlin Heidelberg 1992.
• [2] Pancerz, K., Suraj, Z.: ROSECON - a system for automatic discovering of concurrent models from data tables. In: Proceedings of the IX Environmental Conference on Mathematics and Informatics, Korytnica, June 12-16, 2002, Poland (in Polish), p. 34.
• [3] Pancerz, K., Suraj, Z.: From Data to Nets with Inhibitor Expressions: A Rough Set Approach. In: Z. Suraj (ed.), Proceedings of the Sixth International Conference on Soft Computing and Distributed Processing, Rzeszow, June 24-25, 2002, Poland, pp. 102-106.
• [4] Pawlak, Z.: Rough Sets – Theoretical Aspects of Reasoning About Data. Kluwer Academic Publishers, Dordrecht 1991.
• [5] Pawlak, Z.: Concurrent versus sequential the rough sets perspective. Bulletin of the EATCS, 48, 1992, pp.178-190.
• [6] Pawlak, Z.: Some Remarks on Explanation of Data and Specification of Processes Concurrent. Bulletin of International Rough Set Society, 1-1, 1997, pp. 1-4.
• [7] Peters, J.F., Skowron, A., Suraj, Z., Pedrycz, W., Ramanna, S.: Approximate Real-Time Decision Making: Concepts and Rough Fuzzy Petri Net Models. International Journal of Intelligent Systems, 14-4, 1998, pp. 4-37.
• [8] Peterson, J.L.: Petri Net Theory and the Modelling of Systems. Prentice-Hall, Englewood Cliffs 1981.
• [9] Reisig, W.: Petri Nets. An Introduction. EATCS Monographs on Theoretical Computer Sciences, Vol. 4, Springer-Verlag, Berlin 1985.
• [10] Rzasa, W., Suraj, Z.: A New Method for Determining of Extensions and Restrictions of Information Systems. In: J.J. Alpigini, J.F. Peters, A. Skowron and N. Zhong (eds.), Proceedings of the RSCTC 2002, Lecture Notes in Artificial Intelligence, Vol. 2475, Springer, Berlin 2002, pp. 197-204.
• [11] Skowron, A., Suraj, Z.: Rough Sets and Concurrency. Bulletin of the Polish Academy of Sciences, Vol. 41,No. 3, 1993, pp. 237-254.
• [12] Skowron, A., Suraj, Z.: A Parallel Algorithm for Real-Time Decision Making: A Rough Set Approach. Journal of Intelligent Information Systems, No. 7, 1996, pp. 5-28.
• [13] Suraj, Z.: Some Remarks on Extensions and Restrictions of Information Systems. In: W. Ziarko, Y. Yao (eds.), Rough Sets and Current Trends in Computing, Lecture Notes in Artificial Intelligence, Vol. 2005, Springer, Berlin 2001, pp. 204-211.
• [14] Suraj, Z.: Discovery of Concurrent Data Models from Experimental Tables: A Rough Set Approach. Fundamenta Informaticae, Vol. 28, No. 3, 4, December 1996, pp. 353-376.
• [15] Suraj, Z.: Rough Set Methods for the Synthesis and Analysis of Concurrent Processes. In: L. Polkowski, S. Tsumoto, T.Y. Lin (eds.) Rough Set Methods and Applications, Springer, Berlin 2000, pp. 379-488.
• [16] Suraj, Z.: The Synthesis Problem of Concurrent Systems Specified by Dynamic Information Systems. In: L. Polkowski and A. Skowron (eds.), Rough Sets in Knowledge Discovery, 2, Physica-Verlag, Berlin, 1998, pp. 418-448.
• [17] Wegener, I.: The complexity of Boolean functions. Wiley and B.G. Teubner, Stuttgart 1987.
• [18] DesignCPN Web Page: http://www.daimi.au.dk/designCPN/