TY - CHAP
T1 - Maximal consistent extensions of information systems
AU - Delimata, Pawel
AU - Moshkov, Mikhail Ju
AU - Skowron, Andrzej
AU - Suraj, Zbigniew
PY - 2009
Y1 - 2009
N2 - The idea of representation of concurrent system by information system is due to Z. Pawlak [61, 73, 74] In such a representation attributes are interpreted as local processes of a concurrent system, values of attributes - as states of local processes, and objects (tuples of values of attributes on objects) - as global states of the considered concurrent system. The knowledge encoded in an information system can be represented by means of true rules which can be extracted from the information system. Besides "explicit" global states, corresponding to objects, the concurrent system generated by the considered information system can also have "hidden" global states, i.e., tuples of attribute values not belonging to a given information system but consistent with all the rules. Such "hidden" states can also be considered as realizable global states. This was a motivation for introducing in [73] maximal consistent extensions of information systems with both "explicit" and "hidden" global states. The maximal consistent extensions of information systems relative to the set of true and realizable deterministic rules were investigated in [70, 73, 85, 86].
AB - The idea of representation of concurrent system by information system is due to Z. Pawlak [61, 73, 74] In such a representation attributes are interpreted as local processes of a concurrent system, values of attributes - as states of local processes, and objects (tuples of values of attributes on objects) - as global states of the considered concurrent system. The knowledge encoded in an information system can be represented by means of true rules which can be extracted from the information system. Besides "explicit" global states, corresponding to objects, the concurrent system generated by the considered information system can also have "hidden" global states, i.e., tuples of attribute values not belonging to a given information system but consistent with all the rules. Such "hidden" states can also be considered as realizable global states. This was a motivation for introducing in [73] maximal consistent extensions of information systems with both "explicit" and "hidden" global states. The maximal consistent extensions of information systems relative to the set of true and realizable deterministic rules were investigated in [70, 73, 85, 86].
UR - http://www.scopus.com/inward/record.url?scp=51849143114&partnerID=8YFLogxK
U2 - 10.1007/978-3-540-85638-2_2
DO - 10.1007/978-3-540-85638-2_2
M3 - Chapter
AN - SCOPUS:51849143114
SN - 9783540856375
T3 - Studies in Computational Intelligence
SP - 9
EP - 29
BT - Inhibitory Rules in Data Analysis
A2 - Delimata, Pawel
A2 - Suraj, Zbigniew
A2 - Moshkov, Mikhail
A2 - Skowron, Andrzej
ER -