نتایج جستجو برای: graph transformation system
تعداد نتایج: 2554783 فیلتر نتایج به سال:
We present Computer Automated Multi-Paradigm Modelling (CAMPaM) (Mosterman and Vangheluwe 2002) for ModelDriven Development based on Meta-Modelling and Graph Transformation. The syntax of a class of models of interest is graphically meta-modelled in an appropriate formalism such as Entity-Relationship Diagrams. From this description of abstract syntax, augmented with concrete (visual) syntax in...
Distributed graph transformation has been used to specify static as well as dynamic aspects of distributed systems. To support distributed designs by diierent developers, local views are introduced. A local view on a distributed system consists of one local system, its import and export interfaces, and connected remote interfaces. The behavior of a local system is speciied by a set of graph rul...
Graph transformation provides an intuitive mechanism for capturing model transformations. In the current paper, we investigate and compare various graph transformation tools using a compact practical model transformation case study carried out as part of the AGTIVE 2007 Tool Contest [22]. The aim of this case study is to generate formal CSP processes from high-level UML activity diagrams, which...
Collaboration diagrams as described in the official UML documents specify patterns of system structure and interaction. In this paper, we propose their use for specifying, in addition, pre/postconditions and state transformations of operations and scenarios. This conceptual idea is formalized by means of graph transformation systems and graph process, thereby integrating the state transformatio...
We consider a distributed system with mobility modelled as a graph transformation system. Then we show that non-secure level processes cannot influence secure level processes, a property formalized as the absence of causal dependencies between such processes. This is done by resorting to an analysis technique for graph transformation systems, called approximated unfolding, based on the construc...
Abstract rewriting systems are often defined as binary relations over a given set of objects. In this paper, we introduce a new notion of abstract rewriting system in the framework of categories. Then, we define the functoriality property of rewriting systems. This property is sometimes called vertical composition. We show that most graph transformation systems are functorial and provide a coun...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید