Abstract
The synthesis problem has been discussed in the literature for various types of formalisms. Our approach is based on the rough set theory and Petri nets. In the paper information systems are used for representing knowledge about the modeled concurrent system. As a model for concurrency coloured Petri nets are chosen. This paper provides an algorithm for constructing a model of a given concurrent system in the form of a net. The net construction consists of two stages. In the first stage, all dependencies represented by means the minimal rules between local states of processes in the system are extracted. In the second stage, a coloured Petri net corresponding to these dependencies is built. Our approach uses a new method for generating the minimal rules in order to solve the synthesis problem considered here. It can be used to deal with various problems arising from the design process of automated systems. The method proposed in the paper has been implemented in the ROSECON system running on IBM PC computers under Windows operating system. This system is permanently evolved. In the paper we assume that the reader is familiarized with the basic notions and notation of rough set theory as well as coloured Petri nets.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Jensen, K.: Coloured Petri Nets. Basic Concepts, Analysis Methods and Practical Use. Vol. 1. Springer, Berlin 1992.
Pancerz, K., Suraj, Z.: ROSECON — a system for automatic discovering of concurrent models from data tables. in: Proc. of the IX Environmental Conference on Mathematics and Informatics, Korytnica, June 12–16, 2002, Poland (in Polish), p. 34.
Pancerz, K., Suraj, Z.: From Data to Nets with Inhibitor Expressions: A Rough Set Approach. in: Z. Suraj (Ed.), Proc. of the Sixth International Conference on Soft Computing and Distributed Processing, Rzeszów, June 24–25, 2002, Poland, pp. 102–106.
Pancerz, K., Suraj, Z.: Modelling Concurrent Systems Specified by Dynamic Information Systems: A Rough Set Approach. in: Proc. of the International Workshop on Rough Sets in Knowledge Discovery and Soft Computing, Warsaw, April 12–13, 2003 (to appear).
Pawlak, Z.: Rough Sets — Theoretical Aspects of Reasoning About Data. Kluwer, Dordrecht 1991.
Reisig, W.: Petri Nets. An Introduction. Springer, Berlin 1985.
Skowron, A., Suraj, Z.: Rough Sets and Concurrency. Bulletin of the Polish Academy of Sciences 41–3 (1993), 237–254.
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.
Skowron, A., Suraj, Z.: Parallel Algorithm for Real-Time Decision Making: A Rough Set Approach. Journal of Intelligent Information Systems 7, Kluwer, Dordrecht 1996, 5–28.
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.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2003 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Suraj, Z., Pancerz, K. (2003). A Synthesis of Concurrent Systems: A Rough Set Approach. In: Wang, G., Liu, Q., Yao, Y., Skowron, A. (eds) Rough Sets, Fuzzy Sets, Data Mining, and Granular Computing. RSFDGrC 2003. Lecture Notes in Computer Science(), vol 2639. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-39205-X_43
Download citation
DOI: https://doi.org/10.1007/3-540-39205-X_43
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-14040-5
Online ISBN: 978-3-540-39205-7
eBook Packages: Springer Book Archive