Discovering Concurrent Models from Data Tables with the ROSECON System

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

Abstrakty

EN

This paper presents an approach to discovering concurrent models from data tables using the ROSECON software system. The acronym ROSECON comes from "ROugh SEts and CONcurrency". The models created using ROSECON have the form of Coloured Petri Nets. The ROSECON system is based on the rough set theory. The models derived by ROSECON can be used to determine different properties concerning structures and behaviours of systems. Running examples illustrate some directions one might take in the study of behavioural patterns in information system tables.

Słowa kluczowe

EN

rough set tools; coloured Petri nets; software system

• Wydawca: IOS Press
• Czasopismo: Fundamenta Informaticae
• Rocznik: 2004
• Tom: Vol. 60, nr 1-4
• Strony: 251--268
• Opis fizyczny: Bibliogr. 22 poz., tab., wykr.

Twórcy

autor

Pancerz K.

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

autor

Suraj Z.

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

• Institute of Mathematics, University of Rzeszów, Rejtana 16A, 35-310 Rzeszów, Poland

Bibliografia

• [1] Billington, J. et al.: The Petri Net Markup Language: Concepts, Technology, and Tools. In: W.M.P. van der Aalst, E. Best (Eds.), Proceedings of the ICATPN 2003, Lecture Notes in Computer Science. Vol. 2679, Springer-Verlag, Berlin Heidelberg. 2003, pp. 483-505.
• [2] Brown, E.M.: Boolean Reasoning. Kluwer Academic Publishers. Dordrecht. 1990.
• [3] Clark. J. (Ed.): XSL Transformations (XSLT) Version 1.0. URL http://www.w3.org/TR/xslt. 1999.
• [4] Design/CPN Reference Manual for X-Windows. Meta Software Corporation, Cambridge, URL http://www.daiini.au.dk/designCPN/man/, 1993.
• [5] Design/CPN System. URL http://www.daimi.au.dk/designCPN/
• [6] Jensen. K.: Coloured Petri Nets. Basic Concepts, Analysis Methods and Practical Use. Vol. I. Springer-Verlag, Berlin Heidelberg, 1996.
• [7] 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, Rzeszów. Poland, June 24-25, 2002, pp. 102-106.
• [8] Pancerz, K., Suraj. Z.: The Synthesis of Concurrent Systems Specified by Information Systems with Using the Coloured Petri Nets. In: H.-D. Burkhard, L. Czaja. G. Lindemann, A. Skowron, P. Starke (Eds.), Proceedings of the Workshop on Concurrency. Specification and Programming, Berlin, Germany, October 7-9, 2002. Vol. 2, pp. 255-266.
• [9] Pancerz, K., Suraj, Z.: Modelling Concurrent Systems Specified by Dynamic Information Systems: A Rough Set Approach. In: A. Skowron, M. Szczuka (Eds.), Proceedings of the International Workshop on Rough Sets in Knowledge Discovery and Soft Computing, Warsaw, Poland. April 12-13, 2003, Electronic Notes in Theoretical Computer Science. Vol. 82, Issue No. 4, Elsevier Science Publishers, 2003
• [10] Pancerz, K., Suraj, Z.: Synthesis of Petri Net Models: A Rough Set Approach. Fundamenta Informaticae, Vol. 55 (2), IOS Press, Amsterdam, 2003, pp. 149-165.
• [11] Pawlak, Z.: Rough Sets - Theoretical Aspects of Reasoning About Data. Kluwer Academic Publishers. Dordrecht, 1991.
• [12] Pawlak, Z.: Concurrent Versus Sequential the Rough Sets Perspective. Bulletin of the EATCS, 48, 1992, pp. 178-190.
• [13] Reisig, W.: Petri Nets. An Introduction. EATCS Monographs on Theoretical Computer Sciences, Vol. 4, Springer-Verlag, Berlin, 1985.
• [14] 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. N. Zhong (Eds.), Proceedings of the RSCTC 2002, Lecture Notes in Artificial Intelligence, Vol. 2475, Springer, Berlin, 2002, pp. 197-204.
• [15] Skowron, A., Suraj, Z.: Rough Sets and Concurrency. Bulletin of the Polish Academy of Sciences, Vol. 41, No. 3, 1993, pp. 237-254.
• [16] Suraj, Z.: Discovery of Concurrent Data Models from Experimental Tables: A Rough Set Approach. Fundamenta Informaticae. Vol. 28 (3-4), IOS Press, Amsterdam. 1996, pp. 353-376.
• [17] Suraj Z.: An Application of Rough Set Methods to Cooperative Information Systems Re-engineering. In: S. Tsumoto, S. Kobayashi. T. Yokomori, H. Tanaka, A. Nakamura (Eds.), Proceedings of the RSFD'96, Tokyo, Japan, November 6-7, 1996, pp. 364-371.
• [18] Suraj. Z.: The Synthesis Problem of Concurrent Systems Specified by Dynamic Information Systems. In: L. Polkowski. A. Skowron (Eds.). Rough Sets in Knowledge Discovery, 2, Physica-Verlag. Berlin, 1998, pp. 418-448.
• [19] Suraj Z.: Reconstruction of Cooperative Information Systems under Cost Constraints: A Rough Set Approach. Journal of Information Sciences, 111, Elsevier Science Publishers, 1998, pp. 273-291.
• [20] 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.
• [21] 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.
• [22] Suraj. Z., Pancerz. K.: A Synthesis of Concurrent Systems: A Rough Set Approach. In: G. Wang. Q. Liu, Y. Yao, A. Skowron (Eds.), Proceedings of the RSFDGrC 2003, Lecture Notes in Artificial Intelligence, Vol. 2639, Springer-Verlag, Berlin Heidelberg, 2003. pp. 299-302.