Fundamenta Informaticae - Volume 99, issue 1

Authors: Khare, Mona | Tiwari, Surabhi

Article Type: Research Article

Abstract: The present paper is devoted to the study of grill determined L-approachmerotopological spaces. The category having such spaces as objects is shown to be a topological construct (its initial and final structures are provided explicitly). The lattice structure of the family of all these spaces is also discussed. In the classical theory, this category (that is, when L={0, 1}) is a supercategory of the category of pseudo metric spaces and nonexpansive maps.

Keywords: L-grill, approach space, merotopology, topological construct

DOI: 10.3233/FI-2010-236

Citation: Fundamenta Informaticae, vol. 99, no. 1, pp. 1-12, 2010

Authors: Maulik, Ujjwal | Sarkar, Anasua

Article Type: Research Article

Abstract: A hybrid unsupervised learning algorithm, which is termed as Parallel Rough-based Archived Multi-Objective Simulated Annealing (PARAMOSA), is proposed in this article. It comprises a judicious integration of the principles of the rough sets theory and the scalable distributed paradigm with the archived multi-objective simulated annealing approach. While the concept of boundary approximations of rough sets in this implementation, deals with the incompleteness in the dynamic classification method with the quality of classification …coefficient as the classificatory competencemeasurement, the time-efficient parallel approach enables faster convergence of the Pareto-archived evolution strategy. It incorporates both the rough set-based dynamic archive classifi- cation method and the distributed implementation as a two-phase speedup strategy in this algorithm. A measure of the amount of domination between two solutions has been incorporated in this work to determine the acceptance probability of a new solution with an improvement in the spread of the non-dominated solutions in the Pareto-front by adopting rough sets theory. A complexity analysis of the proposed algorithm is provided. An extensive comparative study of the proposed algorithm with three other existing and well-known Multi-Objective Evolutionary Algorithms (MOEAs) demonstrate the effectiveness of the former with respect to four existing performance metrics and eleven benchmark test problems of varying degrees of difficulties. The superiority of this new parallel implementation over other algorithms also has been demonstrated in timing, which achieves a near optimal speedup with a minimal communication overhead. Show more

Keywords: Amount of domination, archive, multi-objective optimization, parallel algorithm, rough sets theory, simulated annealing

DOI: 10.3233/FI-2010-237

Citation: Fundamenta Informaticae, vol. 99, no. 1, pp. 13-27, 2010

Authors: Velasco, Pedro Pablo Pérez | de Lara, Juan

Article Type: Research Article

Abstract: In the Matrix approach to graph transformation we represent simple digraphs and rules with Boolean matrices and vectors, and the rewriting is expressed using Boolean operators only. In previous works, we developed analysis techniques enabling the study of the applicability of rule sequences, their independence, state reachability and the minimal graph able to fire a sequence. In the present paper we improve our framework in two ways. First, we make explicit (in the form …of a Boolean matrix) some negative implicit information in rules. This matrix (called nihilation matrix) contains the elements that, if present, forbid the application of the rule (i.e. potential dangling edges, or newly added edges, which cannot be already present in the simple digraph). Second, we introduce a novel notion of application condition, which combines graph diagrams together with monadic second order logic. This allows for more flexibility and expressivity than previous approaches, as well as more concise conditions in certain cases. We demonstrate that these application conditions can be embedded into rules (i.e. in the left hand side and the nihilation matrix), and show that the applicability of a rule with arbitrary application conditions is equivalent to the applicability of a sequence of plain rules without application conditions. Therefore, the analysis of the former is equivalent to the analysis of the latter, showing that in our framework no additional results are needed for the study of application conditions. Moreover, all analysis techniques of [21,22] for the study of sequences can be applied to application conditions. Show more

Keywords: Graph Transformation, Matrix Graph Grammars, Application Conditions, Monadic Second Order Logic, Graph Dynamics

DOI: 10.3233/FI-2010-238

Citation: Fundamenta Informaticae, vol. 99, no. 1, pp. 29-62, 2010

Authors: Orejas, Fernando | Ehrig, Hartmut | Klein, Markus | Padberg, Julia | Pino, Elvira | Pérez, Sonia

Article Type: Research Article

Abstract: The aim of this paper is to present a generic framework for the modelling of componentbased systems using architectural connectors. More precisely, concepts of component, connector and architecture are presented in a formal generic way, which are independent of any semi-formal or formal modelling approach. The idea is that one could use this framework to define component and connector notions for every given modelling formalism. As a main result, we define the semantics of architectures using …graph transformation, showing that the semantics is independent of the order in which the connections are computed, and that the semantics is compatible with transformation. In the continuation of this paper, we show the applicability of our ideas. In particular, our framework is instantiated by Petri nets and CSP, including a case study using Petri Nets. Show more

Keywords: Architectural connectors, formal software modelling, software architecture

DOI: 10.3233/FI-2010-239

Citation: Fundamenta Informaticae, vol. 99, no. 1, pp. 63-93, 2010

Authors: Orejas, Fernando | Ehrig, Hartmut | Klein, Markus | Padberg, Julia | Pino, Elvira | Pérez, Sonia

Article Type: Research Article

Abstract: The aim of this paper is to show how the generic approach to connector architectures, presented in the first part of this work, can be applied to a given modeling formalism to define architectural component and connector notions associated to that formalism. Starting with a review of the generic approach, in this second part of the paper we consider two modeling formalisms: elementary Petri nets and CSP. As main results we show that both cases satisfy …the axioms of our component framework, so that the results concerning the semantics of architectures can be applied. Moreover, a small case study in terms of Petri Nets is presented in order to show how the results can be applied to a connector architecture based on Petri nets. Show more

Keywords: Architectural connectors, formal software modelling, software architecture, Petri nets, CSP

DOI: 10.3233/FI-2010-240

Citation: Fundamenta Informaticae, vol. 99, no. 1, pp. 95-124, 2010