Czasopismo
2013
|
Vol. 127, nr 1-4
|
81--97
Tytuł artykułu
Autorzy
Wybrane pełne teksty z tego czasopisma
Warianty tytułu
Języki publikacji
Abstrakty
Information system of net structures based on their calculus (a distributive lattice) is introduced and, in this context, basic notions of rough set theory are re-formulated and exemplified.
Czasopismo
Rocznik
Tom
Strony
81--97
Opis fizyczny
Bibliogr. 18 poz., rys., tab.
Twórcy
autor
- University of Economics and Computer Science Vistula in Warsaw, Poland, lczaja@mimuw.edu.pl
- University of Warsaw, Poland
Bibliografia
- [1] Berthelot G., Checking Properties of Nets Using Transformations, in: Advances in Petri Nets 1985 (G. Goos and J. Hartmanis eds.), Lecture Notes in Computer Science 222, pp. 19-40
- [2] Czaja L., Process Languages and Nets, Theoretical Computer Science, 238 (2000) pp. 161-181
- [3] Czaja L., Calculi of Net Structures and Sets are Similar, RAIRO, Theoretical Informatics and Application 42 (2008) pp. 271-284
- [4] Dijkstra E.W., Hierarchical ordering of sequential processes, Acta Informatica, 1 (1971)pp, 115-138
- [5] Hoare C.A.R., Notes on Communicating Sequential Processes, Oxford University Computing Laboratory Technical Monograph PRG-33, August 1983
- [6] Hung Son Nguyen, Skowron A., Rough Sets: From Rudiments to Challenges, in Rough Sets and Intelligent Systems (Skowron A. and Suraj Z. eds), ISRL 42, pp. 75-173. Springer-Verlag Berlin Heidelberg 2013
- [7] Mazurkiewicz A., Introduction to Trace Theory, in The Book of Traces (V. Diekert and G. Rozenberg eds), World Scientific (1995) pp. 3-41
- [8] Milner R., Communication and Concurrency, Prentice Hall, International Series in Computer Science, 1989
- [9] Pancerz K., Suraj Z.: Rough Sets for Discovering Concurrent System Models from Data Tables, Rough Computing. Theories and Applications (A. Hassanien, et al, eds), Information Science Reference, Hershey, 2008, pp. 239-268
- [10] Pawlak, Z., Rough Sets.. International Journal of Computer and Information Sciences 11 (5) 1982 pp. 341356
- [11] Pawlak Z., Rough Sets: Theoretical Aspects of Reasoning About Data, Dordrecht: Kluwer Academic Publishers 1991
- [12] Pawlak Z., Concurrent versus sequential the rough sets perspective, Bulletin of the EATCS 48(1992), pp. 178-190
- [13] Pawlak Z., Rough sets theory and its applications, Journal of Telecommunication and Information Technology, 3/2002, pp. 7-10
- [14] Peters J.F., Skowron A., Suraj Z., Ramanna S.: Guarded Transitions in Rough Petri Nets, In: Proc of 7th European Congress on Intelligent Systems & Soft Computing (EUFIT’99), 13-16 Sept. 1999, Aachen, Germany, pp. 2003-2012
- [15] Reisig W.: Petri Nets, An Introduction, EATC Monographs on Theoretical Computer Science, SpringerVerlag, 1985
- [16] Skowron A., Suraj Z.: Rough Sets and Concurrency, Bulletin of the Polish Academy of Sciences 41-3(1993), pp. 237-254
- [17] Stone M.H., The theory of representations for Boolean algebras, Trans. Amer. Math. Soc. 40 (1936), pp. 37-111
- [18] Suraj Z.: Rough Set Methods for the Synthesis and Analysis of Concurrent Processes, Rough Set Methods and Applications (L. Polkowski, et al. Eds.), Springer-Verlag, Berlin, 2000, pp. 379-488
Typ dokumentu
Bibliografia
Identyfikatory
Identyfikator YADDA
bwmeta1.element.baztech-bca00ab7-2c90-4bf9-b699-33354158ec11