Some Remarks on Computing Consistent Extensions of Dynamic Information Systems

Authors:
Zbigniew Suraj;Krzysztof Pancerz
Affiliations:
University of Information Technology andManagement, Rzeszow, Poland;University of Information Technology andManagement, Rzeszow, Poland
Venue:
ISDA '05 Proceedings of the 5th International Conference on Intelligent Systems Design and Applications
Year:
2005

Citing 0
Cited 2

A new version of ROSECON: a software tool for modeling and analyzing systems of processes working together

HSI'09 Proceedings of the 2nd conference on Human System Interactions
Concept Formation: Rough Sets and Scott Systems

Fundamenta Informaticae - To Andrzej Skowron on His 70th Birthday

Quantified Score

Hi-index	0.00

Visualization

Abstract

The aim of this paper is to present some remarks on computingmaximal consistent extensions of dynamic information systems.Dynamic information systems can be used as a tool for description of concurrent systems. In this case, they include the knowledge about global states and transitions between them observed in given concurrent systems. The task of creating a maximal consistent extension is to find all global states and all transitions between them which are consistent with the knowledge included in data tables representing a dynamic information system. A method for computing such an extension is given. The method presented here seems to be more ef- ficient than methods presented earlier in the literature. Our approach is based on the rough set theory.