نتایج جستجو برای: graph transformation system
تعداد نتایج: 2554783 فیلتر نتایج به سال:
Model-driven software engineering requires the refinement of abstract models into more concrete, platform-specific ones. To create and verify such refinements, behavioral models capturing reconfiguration or communication scenarios are presented as instances of a dynamic meta-model, i.e., a typed graph transformation system specifying the concepts and basic operations scenarios may be composed o...
Background: A highly efficient genetic transformation system is essential for a successful genetic manipulation of the African violet (Saintpaulia ionantha Wendl.). Objectives: Developing a particle bombardment-based genetic transformation system for the African violet. Materials and Methods: A local cultivar of the African violet from Guilan province was used for transformation experiments. Th...
We present strategic port graph rewriting as a basis for the implementation of visual modelling and analysis tools. The goal is to facilitate the specification, analysis and simulation of complex systems, using port graphs. A system is represented by an initial graph and a collection of graph rewriting rules, together with a user-defined strategy to control the application of rules. The strateg...
We propose a new approach for modelling the process of RNA folding as a graph transformation guided by the global value of free energy. Since the folding process evolves towards a configuration in which the free energy is minimal, the global behaviour resembles the one of a self-adaptive system. Each RNA configuration is a graph and the evolution of configurations is constrained by precise rule...
We generalize the order-theoretic variant of the Myhill-Nerode theorem to graph languages, and characterize the recognizable graph languages as the class of languages for which the Myhill-Nerode quasi order is a well quasi order. In the second part of the paper we restrict our attention to graphs of bounded interface size, and use Myhill-Nerode quasi orders to verify that, for such bounded grap...
Abstract Embedded real-time systems generate state sequences where time elapses between changes. Ensuring that such adhere to a provided specification of admissible or desired behavior is essential. Formal model-based testing often suitable cost-effective approach. We introduce an extended version the formalism symbolic graphs, which encompasses types as well attributes, for representing states...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید