Reconstruction of Concurrent System Models Described by Decomposed Data Tables

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

Abstrakty

EN

This paper deals with reconstruction of net models of concurrent systems described by information systems changing in time. Constructed net models have the form of coloured Petri nets. Resulting nets are constructed on the basis of decomposed information systems. In many practical cases, a description of modelled systems changes in time. New knowledge about structures and behaviours of systems appears. When new descriptions appear, the net models should be changed taking into consideration the new knowledge. An approach to reconstruction of net models is here presented. One of many possible cases is considered, i.e., when the new global state of the modelled system appears. The ability to compute reducts and components of a new information system, being a new description of a modelled system, in an efficient way is important for reconstruction. Therefore, some propositions and corollaries useful to compute reducts of a new information system on the basis of reducts of an old information system are given. These propositions and corollaries are the basis to formulate algorithms for computing new reducts and components. Moreover, a way to determine the cost of the reconstruction of a net model is given. The cost of the reconstruction is treated as the cost of adding new functional modules, communication lines or their modifications. The discussed approach to model reconstruction extends and refines that proposed by Z. Suraj in 1998. An example is given in this paper to illustrate the presented idea.

Słowa kluczowe

EN

information systems; coloured Petri nets; data table; decomposition; model reconstruction

• Wydawca: IOS Press
• Czasopismo: Fundamenta Informaticae
• Rocznik: 2006
• Tom: Vol. 71, nr 1
• Strony: 121--137
• Opis fizyczny: tab., bibliogr. 11 poz.

Twórcy

autor

Suraj Z.

autor

Pancerz K.

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

Bibliografia

• [1] Jensen, K.: Coloured Petri Nets. Vol. 1: Basic Concepts, Springer Verlag, Berlin, 1997.
• [2] Pancerz, K., Suraj, Z.: Synthesis of Petri Net Models: A Rough Set Approach, Fundamenta Informaticae, 55(2), 2003, 149-165.
• [3] Pancerz, K., Suraj, Z.: An Application of Rough Set Methods to Concurrent System Design, in: Soft Computing, Tools, Techniques and Applications (P. Grzegorzewski, M. Krawczak, S. Zadro˙zny, Eds.), Exit, Warsaw, 2004, 229-244.
• [4] Pancerz, K., Suraj, Z.: Discovering Concurrent Models from Data Tables with the ROSECON System, Fundamenta Informaticae, 60(1-4), 2004, 251-268.
• [5] Pawlak, Z.: Rough Sets - Theoretical Aspects of Reasoning About Data, Kluwer Academic Publishers, Dordrecht, 1991.
• [6] Pawlak, Z.: Concurrent Versus Sequential the Rough Sets Perspective, Bulletin of the EATCS, 48, 1992, 178-190.
• [7] Skowron, A.: Boolean Reasoning for Decision Rules Generation, Proceedings of the ISMIS'1993 (J. Komorowski, Z. Ras, Eds.), LNAI 689, Springer Verlag, Berlin, 1993.
• [8] Skowron, A., Rauszer, C.: The Discernibility Matrices and Functions in Information Systems, in: Intelligent Decision Support. Handbook of Applications and Advances of Rough Set Theory (R. Slowinski, Ed.), Kluwer Academic Publishers, Dordrecht, 1992, 331-362.
• [9] Suraj, Z.: Discovery of Concurrent Data Models from Experimental Tables: A Rough Set Approach, Fundamenta Informaticae, 28(3-4), 1996, 353-376.
• [10] Suraj, Z.: Reconstruction of Cooperative Information Systems under Cost Constraints: A Rough Set Approach, Journal of Information Sciences, 111, 1998, 273-291.
• [11] Suraj, Z.: Rough Set Methods for the Synthesis and Analysis of Concurrent Processes, in: Rough Set Methods and Applications (L. Polkowski, S. Tsumoto, T. Y. Lin, Eds.), Springer, Berlin, 2000, 379-488.