Petri nets: an introduction
The complexity of Boolean functions
The complexity of Boolean functions
Coloured Petri nets: basic concepts, analysis methods and practical use, vol. 2
Coloured Petri nets: basic concepts, analysis methods and practical use, vol. 2
A parallel algorithm for real-time decision making: a rough set approach
Journal of Intelligent Information Systems
Discovery of concurrent data models from experimental tables: a rough set approach
Fundamenta Informaticae - Special issue: to the memory of Prof. Helena Rasiowa
Rough set methods for the synthesis and analysis of concurrent processes
Rough set methods and applications
Rough Sets: Theoretical Aspects of Reasoning about Data
Rough Sets: Theoretical Aspects of Reasoning about Data
Petri Net Theory and the Modeling of Systems
Petri Net Theory and the Modeling of Systems
A New Method for Determining of Extensions and Restrictions of Information Systems
TSCTC '02 Proceedings of the Third International Conference on Rough Sets and Current Trends in Computing
Reconstruction of concurrent system models described by decomposed data tables
Fundamenta Informaticae - Special issue on theory and applications of soft computing (TASC04)
Discovering Concurrent Models from Data Tables with the ROSECON System
Fundamenta Informaticae - Concurrency Specification and Programming (CS&P 2003)
Discovery of Asynchronous Concurrent Models from Experimental Tables
Fundamenta Informaticae - International Conference on Soft Computing and Distributed Processing (SCDP'2002)
Towards Efficient Computing Consistent and Partially Consistent Extensions of Information Systems
Fundamenta Informaticae - Special Issue on Concurrency Specification and Programming (CS&P)
On Irreducible Descriptive Sets of Attributes for Information Systems
RSCTC '08 Proceedings of the 6th International Conference on Rough Sets and Current Trends in Computing
On Computing Extensions and Restrictions of Information Systems Noting Some Order Properties
Fundamenta Informaticae - Concurrency Specification and Programming (CS&P)
Irreducible descriptive sets of attributes for information systems
Transactions on Rough Sets XI
On testing membership to maximal consistent extensions of information systems
RSCTC'06 Proceedings of the 5th international conference on Rough Sets and Current Trends in Computing
On consistent and partially consistent extensions of information systems
RSFDGrC'05 Proceedings of the 10th international conference on Rough Sets, Fuzzy Sets, Data Mining, and Granular Computing - Volume Part I
| Hi-index | 0.00 |
The synthesis problem of concurrent data models from experimental tables based on rough set approach has earlier been discussed [14], [15]. Classical Petri nets have been used as a model for concurrency. In this paper we propose the nets with inhibitor expressions and Coloured Petri Nets as models for concurrency. The nets with inhibitor expressions are defined on the base of so called inhibitor rules extracted from modelled systems. The approach presented in this paper enables to implement the algorithms for easier construction of Petri net models. The proposed approach can be applied to discover data models in semi-automatic way. The obtained models enable us to determine all global states of a modelled system represented by an information system, consistent with all rules extracted from the given information system.