Discovery of Asynchronous Concurrent Models from Experimental Tables

• Autorzy: Pancerz K. , Suraj Z.
• Konferencja: International Conference on Soft Computing and Distributed Processing (SCDP'2002)(June 2002, Rzeszów, Poland)
• Języki publikacji: EN

Abstrakty

EN

The synthesis problem of concurrent systems has earlier been discussed in the literature using different types of formalisms. This paper presents a new method for discovery of asynchronous concurrent models from experimental tables by using a rough set approach. The proposed method can be applied to the automatic data model discovery. The algorithm for constructing asynchronous concurrent models is described in detail. As a model for concurrency the Coloured Petri Nets are used. Constructed asynchronous models can be helpful to solving some problems arising in design of asynchronous digital systems or addressing of nodes in parallel systems. An example illustrates an application of the proposed approach in such problems.

Słowa kluczowe

EN

information systems; rough sets; concurrency; asynchronous models; coloured Petri nets

• Wydawca: IOS Press
• Czasopismo: Fundamenta Informaticae
• Rocznik: 2004
• Tom: Vol. 61, nr 2
• Strony: 97--116
• Opis fizyczny: Bibliogr. 20 poz., wykr., tab.

Twórcy

autor

Pancerz K.

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

autor

Suraj Z.

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

Bibliografia

• [1] Diestel. R.: Graph Theory. Springer, New York. 2000.
• [2] Jensen, K.: Coloured Petri Nets. Basic Concepts. Analysis Methods and Practical Use. Vol. I. Springer. Berlin, 1992.
• [3] Jensen, K.: An Introduction to the Theoretical Aspects of Coloured Petri Nets. In: J.W. de Bakker. W.-P. de Roever, G. Rozenberg (eds.). A Decade of Concurrency. Lecture Notes in Computer Science, Vol. 803, Springer-Verlag, 1994, pp. 230-272.
• [4] Pancerz. K., Suraj. Z.: From Data to Nets with Inhibitor Expressions: A Rough Set Approach. In: Z. Suraj (ed.), Proceeding's of the Sixth International Conference on Soft Computing and Distributed Processing, Rzeszow. June 24-25, 2002, Poland, pp. 102-106.
• [5] 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 and P. Starke (eds.), Proceedings of the Workshop on Concurrencv. Specification and Programming, Berlin. October 7-9, 2002. Germany, vol. 2. pp. 255-266.
• [6] Pancerz, K., Suraj. Z.: Synthesis of Petri Net Models: A Rough Set Approach. Fundamenta Informaticae, Vol. 55, No. 2. lOS Press. Amsterdam, 2003, pp. 149-165.
• [7] Pawlak. Z.: Rough Sets - Theoretical Aspects of Reasoning About Data. Kluwer Academic Publishers, Dordrecht, 1991.
• [8] Pawlak, Z.: Concurrent versus sequential the rough sets perspective. Bulletin of the EATCS, 48. 1992, pp. 178-190.
• [9] 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.
• [10] 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.
• [11] Peters, J.F., Skowron, A.. Suraj, Z.: An Aplication of Rough Set Methods in Control Design. Fundamenta Informaticae. Vol. 43, No. 1-4, IOS Press, Amsterdam, 2000, pp. 269-290.
• [12] Reisig. W.: Petri Nets. An Introduction. EATCS Monographs on Theoretical Computer Sciences, Vol. 4, Springer-Verlag, Berlin, 1985.
• [13] 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.
• [14] Skowron, A., Suraj, Z.: Rough Sets and Concurrency. Bulletin of the Polish Academy of Sciences, Vol. 41, No. 3, 1993, pp. 237-254.
• [15] Skowron, A., Suraj, Z.: 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.
• [16] Suraj. Z.: Discovery of Concurrent Data Models from Experimental Tables: A Rough Set Approach. Fundamenta Informaticae, Vol. 28, No. 3-4, IOS Press, Amsterdam, 1996, pp. 353-376.
• [17] 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, Physic a-Verlag, Berlin, 1998, pp. 418-448.
• [18] 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.
• [19] 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.
• [20] Design/CPN Web Page: http:// www.daimi.au.dk/designCPN/