Fundamenta Informaticae - Volume 128, issue 1-2

Authors: Czaja, Ludwik

Article Type: Other

DOI: 10.3233/FI-2013-928

Citation: Fundamenta Informaticae, vol. 128, no. 1-2, pp. v-v, 2013

Authors: Azad, Mohammad | Chikalov, Igor | Moshkov, Mikhail | Zielosko, Beata

Article Type: Research Article

Abstract: In the paper, we study a greedy algorithm for construction of decision trees. This algorithm is applicable to decision tables with many-valued decisions where each row is labeled with a set of decisions. For a given row, we should find a decision from the set attached to this row. Experimental results for data sets from UCI Machine Learning Repository and randomly generated tables are presented. We make a comparative study of the depth and average depth of the constructed decision trees for proposed approach and approach based on generalized decision. The obtained results show that the proposed approach can be …useful from the point of view of knowledge representation and algorithm construction. Show more

Keywords: Decision table with many-valued decisions, decision tree, greedy algorithm

DOI: 10.3233/FI-2013-929

Citation: Fundamenta Informaticae, vol. 128, no. 1-2, pp. 1-15, 2013

Authors: Bellia, Marco | Occhiuto, M. Eugenia

Article Type: Research Article

Abstract: The last proposal for Java closures, as emerged in JSR 000335, is mainly innovative in: (1) Use of nominal types, SAM types, for closures; (2) Introduction of target types and compatibility for a contextual typing of closures; (3) Need for a type inference that reconstructs the omitted type annotations of closures and closure arguments. The paper provides a sound and complete type system, with nominal types, for such a type inference and discusses role and formalization of targeting and of compatibility in the designed inference process.

DOI: 10.3233/FI-2013-930

Citation: Fundamenta Informaticae, vol. 128, no. 1-2, pp. 17-33, 2013

Authors: Czaja, Ludwik

Article Type: Research Article

DOI: 10.3233/FI-2013-931

Citation: Fundamenta Informaticae, vol. 128, no. 1-2, pp. 35-45, 2013

Authors: Dąbrowski, Robert | Timoszuk, Grzegorz | Stencel, Krzysztof

Article Type: Research Article

Abstract: The software architecture is typically defined as the fundamental organization of the system embodied in its components, their relationships to one another and to the system's environment. It also encompases principles governing the system's design and evolution. In order to manage the architecture of a large software system the architect needs a holistic model that supports continuous integration and verification for all system artifacts. In earlier papers we proposed a unified graph-based approach to the problem of managing knowledge about the architecture of a software system. In this paper we demonstrate that this approach facilitates convenient and efficient project measurement. …First, we show how existing software metrics can be translated into our model in a way that is independent of the programming language. Second, we introduce new metrics that cross the programming language boundaries and are easily implementable using our approach. We conclude by demonstrating how the new model can be implemented using existing tools. In particular, graph databases are a convenient implementation of an architectural repository. Graph query languages and graph algorithms are an effective way to define metrics and specialized graph views. Show more

Keywords: software measurement, architectural knowledge, software architecture

DOI: 10.3233/FI-2013-932

Citation: Fundamenta Informaticae, vol. 128, no. 1-2, pp. 47-63, 2013

Authors: Grabowski, Adam

Article Type: Research Article

Abstract: The computer certification of rough sets (the translation in a way understandable by machines) seems to be far beyond the test phase. To assure the feasibility of the approach, we try to encode selected problems within rough set theory and as the testbed of already developed foundations – and in the same time as a payoff of the established framework – we shed some new light on the well-known question of generalization of rough sets and the axiomatization of approximation operators in terms of (various types of) binary relations. We show how much the human work can be enhanced with …the use of automatic tools, without loosing too much time for the translation. Although the syntax is understandable by the computer, it offers relative flexibility and expressive power of the formal language. Show more

Keywords: rough sets, generalized rough approximations, formalization of mathematics

DOI: 10.3233/FI-2013-933

Citation: Fundamenta Informaticae, vol. 128, no. 1-2, pp. 65-79, 2013

Authors: Gruska, Damas P.

Article Type: Research Article

Abstract: Process testing as a way to obtain information on confidential data is investigated. Our working formalism is based on an appropriate (probabilistic) process algebra and (probabilistic) testing. We define testing noninterference as well as sets of private actions which execution is guaranteed by a given test and sets of actions which execution could be excluded by a given test. Moreover, we relate obtained information to a size of the test.

Keywords: probabilistic process algebras, information flow, security

DOI: 10.3233/FI-2013-934

Citation: Fundamenta Informaticae, vol. 128, no. 1-2, pp. 81-95, 2013

Authors: Köhler-Bußmeier, Michael

Article Type: Research Article

Abstract: In this paper we develop a negotiation and contracting framework for inter-organisational workflows. The overall aim is to compute a group-plan from a given set of individual plans, where plans are formulated in the context of a given inter-organisational workflow between the agents. A general problem is that the individual plans are not consistent, i.e. the intersection of all individual plans does not contain a complete process, which leads from the initial state of the workflow to its final state. Therefore, negotiation is needed to obtain a compromise. In this paper we develop a generic negotiation protocol and use branching …processes as the elementary data structure. The generic protocol is adapted within the specifics of our SONAR-framework. SONAR is a specification framework that defines the organisational structure of multi-agent systems. SONAR has a formal notion of teams and team-formation which is used here to instantiate the strategy parameters. Show more

Keywords: branching processes, inter-organisational workflow, negotiation protocol, partial plans, Petri net, SONAR, teamwork, unfoldings

DOI: 10.3233/FI-2013-935

Citation: Fundamenta Informaticae, vol. 128, no. 1-2, pp. 97-111, 2013

Authors: Kudlek, Manfred | Flick, Nils Erik

Article Type: Research Article

Abstract: We present basic structures, definitions, normal forms, and a hierarchy of languages based on catenation, shuffle and their iterations, defined by algebraic closures or least fixed point solutions to systems of equations.

DOI: 10.3233/FI-2013-936

Citation: Fundamenta Informaticae, vol. 128, no. 1-2, pp. 113-128, 2013

Authors: Lomazova, Irina A. | Romanov, Ivan V.

Article Type: Research Article

Abstract: In this work we consider modeling of services with workflow modules, which form a Petri net subclass. The service compatibility problem is to answer the question, whether two services fit together, i.e. whether the composed system is correct. We study complementarity of resources, produced/consumed by two services—a necessary condition for the service compatibility. Resources, which are produced/consumed by a service, are represented as a multiset language. We define an algebra of multiset languages and present algorithms for checking conformance of resources for two given well-structured workflow modules.

DOI: 10.3233/FI-2013-937

Citation: Fundamenta Informaticae, vol. 128, no. 1-2, pp. 129-141, 2013