Some new results in the modeling of the evolution of concurrent processes, in terms of Petri nets and rough set theory, are discussed in this paper. The main goal of the paper is to define new concepts and tools, in order to facilitate the construction of concurrency models as compared to classical Petri nets. Most of the results extend previously published work from the same authors.

The presentation is structured into seven sections. Following a brief exposure of the basic notions of information systems, presented in the first two sections, nets with inhibitor expressions (IF-nets) and colored Petri nets (CP-nets) are introduced in section 3, as generalizations of the Petri net model.

Section 5 supplies, for a given information system S, the solution of the synthesis problem in the form of an IF-net and as a CP-net, both constructed on the base rules extracted from the considered information system. Both constructions are expressed algorithmically. The reported methods, written in Visual C++, are already implemented in the ROSECON system, which runs on IBM PC computers under the Windows operating system.

The final part of the paper presents a series of useful bibliographical references, helping the reader to gather more information about similar work published in this area. The work presented in the paper will be particularly interesting for scientists in the field of modeling concurrency and related topics. The approach and developments presented will be useful in discovering data models in an algorithmic way, as well as in the construction of Petri net models.