Fundamenta Informaticae - Volume 54, issue 4

Authors: Devillers, Raymond | Klaudel, Hanna | Koutny, Maciej | Pommereau, Franck

Article Type: Research Article

Abstract: IThe starting point of this paper is an algebraic Petri net framework allowing one to express net compositions, such as iteration and parallel composition, as well as transition synchronisation and restriction. We enrich the original model by introducing new constructs supporting asynchronous interprocess communication. Such a communication is made possible thanks to special 'buffer' places where different transitions (processes) may deposit and remove tokens. We also provide an abstraction mechanism, which hides buffer …places, effectively making them private to the processes communicating through them. We then provide an algebra of process expressions, whose constants and operators directly correspond to those used in the Petri net framework. Such a correspondence is used to associate nets to process expressions in a compositional way. That the resulting algebra of expressions is consistent with the net algebra is demonstrated by showing that an expression and the corresponding net generate isomorphic transition systems. This results in the Asynchronous Box Calculus (or ABC), which is a coherent dual model, based on Petri nets and process expressions, suitable for modelling and analysing distributed systems whose components can interact using both synchronous and asynchronous communication. Show more

Keywords: Petri nets, process algebra, synchronous and asynchronous communication, structured operational semantics

Citation: Fundamenta Informaticae, vol. 54, no. 4, pp. 295-344, 2003

Authors: Moshkov, Mikhail Ju.

Article Type: Research Article

Abstract: In this paper, infinite information systems used in pattern recognition, data mining, discrete optimization, and computational geometry are investigated. Time and space complexity of decision trees and complete decision rule systems are studied. A partition of the set of all infinite information systems into two classes is considered. Information systems from the first class are close to the best from the point of view of time and space complexity of decision trees and decision rule systems. …Decision trees and decision rule systems for information systems from the second class have in the worst case large time or space complexity. Show more

Keywords: decision trees, decision rule systems, time complexity, space complexity

Citation: Fundamenta Informaticae, vol. 54, no. 4, pp. 345-368, 2003

Authors: Terlikowski, Tomasz

Article Type: Research Article

Abstract: In this paper, continuing our research in [10] and [11] we introduce the notion of descriptional independence. This notion is aimed at a formalization of the concept of sequential control structure, used in the control theory. The reader will find all relevant notions in [10] and [11] positive implication, inner implication, descriptional independence, sequential control structure.

Keywords: positive implication, inner implication, descriptional independence, sequential control structure

Citation: Fundamenta Informaticae, vol. 54, no. 4, pp. 369-385, 2003

Authors: Wakulicz-Deja, Alicja | Peszek, Piotr

Article Type: Research Article

Abstract: The work contains an example of application of Rough Set Theory to decision making – diagnosing Mitochondrial Encephalomyopathies (MEM) for children. The resulting decision support system maximally limits the indications for invasive diagnostic methods (puncture, muscle and/or nerve specimens). Moreover, it shortens the time necessary for making diagnosis. The system has been developed on the basis of data obtained from the II Clinic Department of Pediatrics of the Silesian Academy of Medicine (further referred …to as the Clinic of Pediatrics). Show more

Keywords: machine learning, mitochondrial encephalomyopathies, rough sets

Citation: Fundamenta Informaticae, vol. 54, no. 4, pp. 387-408, 2003