7,757 research outputs found
Optimization in Graph Transformation Systems with Time Using Petri Net Based Techniques
Extra–functional properties of IT systems have to be analyzed and subsequently optimized carefully during the design phase in order to assure a proper quality of service and decrease operational costs. Several verification and validation methods are known to check the correctness of the system services, while optimization may serve to reach boundaries thus minimizing costs or duration of operating the system. However, the combination of the best practices of the two fields according to the purpose of the analysis is a challenging question. In a previous paper, we showed how such a problem can be formalized and solved when the evolution of the system is captured by graph transformation systems (GTS) with cost parameters attached to each graph transformation rule denoting the cost of firing the rule.This technique is adapted in the current paper to deliver a time–optimal trajectory in a GTS with time. While the cost of a GT rule sequence always equals to the sum of the cost of the involved GT rules, the concurrent application of GT rules may reduce the minimal duration of a GT rule sequence, which is a major conceptual difference concerning optimization
Automating the transformation-based analysis of visual languages
The final publication is available at Springer via http://dx.doi.org/10.1007/s00165-009-0114-yWe present a novel approach for the automatic generation of model-to-model transformations given a description of the operational semantics of the source language in the form of graph transformation rules. The approach is geared to the generation of transformations from Domain-Specific Visual Languages (DSVLs) into semantic domains with an explicit notion of transition, like for example Petri nets. The generated transformation is expressed in the form of operational triple graph grammar rules that transform the static information (initial model) and the dynamics (source rules and their execution control structure). We illustrate these techniques with a DSVL in the domain of production systems, for which we generate a transformation into Petri nets. We also tackle the description of timing aspects in graph transformation rules, and its analysis through their automatic translation into Time Petri netsWork sponsored by the Spanish Ministry of Science and Innovation, project METEORIC (TIN2008-02081/TIN) and by the Canadian Natural Sciences and Engineering Research Council (NSERC)
A Taxonomy of Workflow Management Systems for Grid Computing
With the advent of Grid and application technologies, scientists and
engineers are building more and more complex applications to manage and process
large data sets, and execute scientific experiments on distributed resources.
Such application scenarios require means for composing and executing complex
workflows. Therefore, many efforts have been made towards the development of
workflow management systems for Grid computing. In this paper, we propose a
taxonomy that characterizes and classifies various approaches for building and
executing workflows on Grids. We also survey several representative Grid
workflow systems developed by various projects world-wide to demonstrate the
comprehensiveness of the taxonomy. The taxonomy not only highlights the design
and engineering similarities and differences of state-of-the-art in Grid
workflow systems, but also identifies the areas that need further research.Comment: 29 pages, 15 figure
Computational models for inferring biochemical networks
Biochemical networks are of great practical importance. The interaction of biological compounds in cells has been enforced to a proper understanding by the numerous bioinformatics projects, which contributed to a vast amount of biological information. The construction of biochemical systems (systems of chemical reactions), which include both topology and kinetic constants of the chemical reactions, is NP-hard and is a well-studied system biology problem. In this paper, we propose a hybrid architecture, which combines genetic programming and simulated annealing in order to generate and optimize both the topology (the network) and the reaction rates of a biochemical system. Simulations and analysis of an artificial model and three real models (two models and the noisy version of one of them) show promising results for the proposed method.The Romanian National Authority for Scientific Research, CNDI–UEFISCDI,
Project No. PN-II-PT-PCCA-2011-3.2-0917
Optimal trajectory generation for Petri nets
Recently, the increasing complexity of IT systems requires the early verification and validation of the system design in order to avoid the costly redesign. Furthermore, the efficiency of system operation can be improved by solving system optimization problems (like resource allocation and scheduling problems). Such combined optimization and validation, verification problems can be typically expressed as reachability problems with quantitative or qualitative measurements. The current paper proposes a solution to compute the optimal trajectories for Petri net-based reachability problems with cost parameters. This is an improved variant of the basic integrated verification and optimization method introduced in [11] combining the efficiency of Process Network Synthesis optimization algorithms with the modeling power of Petri nets
A Petri Nets-based Scheduling Methodology forMultipurpose Batch Plants.
This article presents an optimization methodology of batch production processes assembled by shared resources which rely on a mapping of state-events into time-events allowing in this way the straightforward use of a well consolidated scheduling policies developed for manufacturing systems. A technique to generate the timed Petri net representation from a continuous dynamic representation (Differential-Algebraic Equations systems (DAEs)) of the production system is presented together with the main characteristics of a Petri nets-based tool implemented for optimization purposes. This paper describes also how the implemented tool generates the coverability tree and how it can be pruned by a general purpose heuristic. An example of a distillation process with two shared batch resources is used to illustrate the optimization methodology proposed
Termination Criteria for Model Transformation
Nowadays the usage of model transformations in software engineering has become widespread. Considering current trends in software development such as
model driven development (MDD), there is an emerging need to develop
model manipulations such as model evolution and optimisation, semantics
definition, etc. If a model transformation is described
in a precise way, it can be analysed lateron. Models, especially visual models, can be
described best by graphs, due to their multi-dimensional extension.
Graphs can be manipulated by graph transformation in a rule-based
manner. Thus, we specify model transformation by graph transformation.
This approach offers visual and formal techniques in such a way that model transformations can be subjects to analysis. Various results on graph transformation can be used to prove important properties of model transformations such as its functional behaviour, a basic property for computations. Moreover, certain kinds of syntactical and semantical consistency properties can be shown on this formal basis
Computer automated multi-paradigm modelling for analysis and design of traffic networks
Personal use of this material is permitted. Permission from IEEE must be obtained for all other uses, in any current or future media, including reprinting/republishing this material for advertising or promotional purposes, creating new collective works, for resale or redistribution to servers or lists, or reuse of any copyrighted component of this work in other works. H. Vangheluwe, and J. de Lara, "Computer automated multi-paradigm modelling for analysis and design of traffic networks", Proceedings of the 2004 Winter Simulation Conference, 2004, Volumen 1, Heidelberg, Germany, 2004Computer automated multiparadigm modelling (CAMPaM) is an enabler for domain-specific analysis and design. Traffic, a new untimed visual formalism for vehicle traffic networks, is introduced. The syntax of traffic models is meta-modelled in the entity-relationship diagrams formalism. From this, augmented with concrete syntax information, a visual modelling environment is synthesized using our CAMPaM tool AToM3, a tool for multiformalism and meta-modelling. The semantics of the traffic formalism is subsequently modelled by mapping traffic models onto Petri net models. As models' abstract syntax is graph-like, graph rewriting can be used to transform models. The advantages of a domain-specific formalism such as traffic as opposed to a generic formalism such as Petri nets are presented. We demonstrate how mapping onto Petri nets allows one to employ the vast array of Petri net analysis techniques. A coverability graph is generated and conservation analysis is automated by transforming this graph into an integer linear programming specificationJuan de Lara’s work has been partially sponsored by the Spanish Interdepartmental Commission of Science and Technology (CICYT), project number TIC2002-01948. Hans
Vangheluwe gratefully acknowledges partial support for this work by a National Sciences and Engineering Research Council of Canada (NSERC) Individual Research Grant.
The authors wish to thank Ms. Sokhom Pheng for her work on the Petri Net conservation analysis during her “Modelling and Simulation Based Design” project at McGill Universit
- …