A synthesis of concurrent systems: A rough set approach

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.