3,718 Hits in 4.8 sec

Generating Test Cases for Code Generators by Unfolding Graph Transformation Systems [chapter]

Paolo Baldan, Barbara König, Ingo Stürmer
2004 Lecture Notes in Computer Science  
Since the representation of code generators in terms of graph grammars typically makes use of rules with negative application conditions, the unfolding approach is extended to deal with this feature.  ...  This is done by formalising the behaviour of a code generator by means of graph transformation rules and exploiting unfolding-based techniques.  ...  The unfolding of a graph grammar with negative application conditions is defined as a Petri graph [5] , i.e., a graph with a Petri net "over it", using the edges of the graph as places.  ... 
doi:10.1007/978-3-540-30203-2_15 fatcat:fkiz5g2pebduzetj364is3dbda

Foreword: special issue on structure transformation

2014 Mathematical Structures in Computer Science  
The subject of the seminar was Graph transformations and process algebras for modelling distributed and mobile systems, with a focus on comparing them in terms of operational and observational semantics  ...  In both cases, the idea was to start with a reduction operational semantics defined by a set of ground term rewriting rules in the case of reactive systems and double pushout (DPO) graph diagrams in the  ...  Nested application conditions are important for several application domains and generalise the well-known negative application conditions.  ... 
doi:10.1017/s0960129512000308 fatcat:65epr5svhzgivbeb743oqxbb6u

Unfolding and Event Structure Semantics for Graph Grammars [chapter]

Paolo Baldan, Andrea Corradini, Ugo Montanari
1999 Lecture Notes in Computer Science  
Mimicking Winskel's construction for Petri nets, a graph grammar is unfolded into an acyclic branching structure, that is itself a (nondeterministic occurrence) graph grammar describing all the possible  ...  We propose an unfolding semantics for graph transformation systems in the double-pushout (DPO) approach.  ...  The dangling condition, being a negative (non monotone) condition, can hardly be veri ed during the unfolding process.  ... 
doi:10.1007/3-540-49019-1_6 fatcat:whqurgtww5atbp6zrj7f7e4g6e

Unfolding of Double-Pushout Graph Grammars is a Coreflection [chapter]

Paolo Baldan, Andrea Corradini, Ugo Montanari
2000 Lecture Notes in Computer Science  
This paper faces the problem of providing a closer correspondence with Winskel's result by showing that the unfolding construction can be described as a core ection between the category of graph grammars  ...  In a recent paper, mimicking Winskel's construction for Petri nets, a concurrent semantics for (double-pushout) DPO graph grammars has been provided by showing that each graph grammar can be unfolded into  ...  The reason why we did not consider the dangling condition in the de nition of occurrence grammar is that checking such negative (non-monotonic) condition on a production, would require to nd a possible  ... 
doi:10.1007/978-3-540-46464-8_11 fatcat:5lec3s2z3jba3kjsjgphyhr64u

Simulation of Generalised Semi-Markov Processes based on Graph Transformation Systems

Piotr Kosiuczenko, Georgios Lajios
2007 Electronical Notes in Theoretical Computer Science  
This paper proposes a stochastic model based on graph transformation with general probability distributions.  ...  Stochastic Graph Transformation combines graphical modelling of various software artefacts with stochastic analysis techniques.  ...  Acknowledgement Discussions with Reiko Heckel improved the ideas presented in this paper. Karsten Ehrig and Olga Runge helped us with AGG. Many thanks to all of them.  ... 
doi:10.1016/j.entcs.2007.04.018 fatcat:2gq2ipc4ebb5dj5bfynwbym52m

Concurrency for Graph Grammars in a Petri net shell

P Baldan
2004 Electronical Notes in Theoretical Computer Science  
Inspired by this correspondence we develop truly concurrent semantics for dpo graph grammars based on (deterministic) processes and on a Winskel's style unfolding construction, and we show that the two  ...  Graph grammars are a powerful model of concurrent and distributed systems which can be seen as a proper extension of Petri nets.  ...  Hence, as required by a part of the application condition, the so-called dangling condition, a production q which removes a node n cannot be applied if there are edges with source or target in n, not removed  ... 
doi:10.1016/s1571-0661(04)00192-6 fatcat:wrvdeitwenf43ltcatn5oqkp2q

Unfolding semantics of graph transformation

Paolo Baldan, Andrea Corradini, Ugo Montanari, Leila Ribeiro
2007 Information and Computation  
Several attempts have been made of extending to graph grammars the unfolding semantics originally developed by Winskel for (safe) Petri nets, but only partial results were obtained.  ...  The typing functions for the productions and the start graph are represented by labelling any graph item with the corresponding item of the type graph.  ...  This is due to the fact that in dpo graph grammars, the possibility of applying a rule to a graph is subject to an application condition, the so-called dangling condition.  ... 
doi:10.1016/j.ic.2006.11.004 fatcat:3umoekfdejccdpepfa4757fgum

A Graph-Theoretic Approach to Sequent Derivability in the Lambek Calculus

Gerald Penn
2004 Electronical Notes in Theoretical Computer Science  
A graph-theoretic construction for representing the derivational side-conditions in the construction of axiomatic linkages for Lambek proof nets is presented, along with a naive algorithm that applies  ...  Some basic properties of this construction are also presented, and some complexity issues related to parsing with Lambek Categorial Grammars are discussed.  ...  All other nodes in the LC-graph were introduced at a location in the lexical unfolding with a negative formula somewhere beneath them.  ... 
doi:10.1016/s1571-0661(05)82589-7 fatcat:4toncaviwjb3hppeuwzvxo73xa

Processes and unfoldings: concurrent computations in adhesive categories

2014 Mathematical Structures in Computer Science  
application conditions of dpo rewriting are avoided.  ...  But there are many types of graph transformation formalisms, based on undirected and directed graphs, hypergraphs, graphs with scopes, graphs with second-order edges, and so forth.  ...  Processes and unfolding-like structures have also been studied in the setting of subobject transformation systems (Corradini, Hermann and Sobociński, 2008) , incorporating negative application conditions  ... 
doi:10.1017/s096012951200031x fatcat:umx7pscecfep7aozlehi72dsny

Automated Assistance for Search-Based Refactoring Using Unfolding of Graph Transformation Systems [chapter]

Fawad Qayum
2010 Lecture Notes in Computer Science  
CONTENTS iii 2.5.1 GXL (Graph eXchange Language  ...  Acknowledgements First and foremost I offer my sincerest gratitude to my supervisor, Professor Reiko Heckel, who has supported me thoughout my thesis with his patience and knowledge whilst allowing me  ...  Unfolding of Graph Grammars Before we give an impression of the technique, presented in [6] , for the construction of a finite approximation of the unfolding of a graph grammar, we summarise the class  ... 
doi:10.1007/978-3-642-15928-2_34 fatcat:dkwpg3ylnbdwtadpklbvrfogum

Page 6991 of Mathematical Reviews Vol. , Issue 96k [page]

1996 Mathematical Reviews  
Summary: “A conditional grammar is a usual context-free gram- mar where with any production a regular set is associated and a production p is only applicable to a sentential form w if w is contained in  ...  {For the entire collection see MR 96h:68008. } 96k:68123 96k:68121 68Q50 68Q45 Dassow, Jiirgen (D-MAGC; Magdeburg); Hornig, Holger Conditional grammars with subregular conditions.  ... 

A graph grammar-based formal validation of object-process diagrams

Arieh Bibliowicz, Dov Dori
2011 Journal of Software and Systems Modeling  
This work advances the formal definition of OPM by providing a graph grammar for creating and checking OPM diagrams.  ...  Most modeling methodologies satisfy only one of these apparently contradicting requirements, usually comprehensibility, leaving aside problems of correctness and ambiguousness that are associated with  ...  Definition 8 Application Conditions Definition 9 Conditional Production  A conditional production ) , ( A R L p p    is a pair consisting of a partial graph morphism p and an application condition  ... 
doi:10.1007/s10270-011-0201-4 fatcat:mijwnwhybndgvgtpegyko3yzzi

Contents and abstracts of the electronic notes in Theoretical Computer Science vol. 2

Andrea Corradini, Ugo Montanari
1998 Theoretical Computer Science  
Conditional application conditions may express positive and negative context conditions as well as combinations of them consisting of a premise and a disjunction of conclusions (similar to Gentzen formulas  ...  pushout type are extended by conditional application conditions and consistency conditions.  ...  Adapting previously made proposals for a graph grammar module concept and for graph models with information hiding to this setting, the new approach supports structuring of large specifications into small  ... 
doi:10.1016/s0304-3975(97)83719-x fatcat:r47zmpkxhfehtaenl2crpu6sk4

The tree equivalence of linear recursion schemes

V. Sabelfeld
2000 Theoretical Computer Science  
If interpretations with ∃d:I (f)(d; ⊥) = ⊥ are allowed then det(S) coincides with the unfolding tree.  ...  and the grammar ) to all other nodes of Graph(S), • a semantic function which associates a distributive grammar transformer <call(a)= to any edge a of Graph(S).  ...  Let us show how the separation condition can be achieved by means of rule applications for variables of an arbitrary pair S; S of recursion schemes.  ... 
doi:10.1016/s0304-3975(98)00207-2 fatcat:w7rkus4jcfbgbnxnq2pd36zx4m

Using Graph Transformation for Practical Model-Driven Software Engineering [chapter]

Lars Grunske, Leif Geiger, Albert Zündorf, Niels Van Eetvelde, Pieter Van Gorp, Dániel Varró
2005 Model-Driven Software Development  
The chapter provides an overview about the needed concepts to apply graph transformations in the context of model driven engineering and we show the technical feasibility based on several tools and applications  ...  A suitable formalism is based on graph transformation systems and graph transformation rules.  ...  , maybe clauses, negative application conditions, path expressions, etc.  ... 
doi:10.1007/3-540-28554-7_5 fatcat:t4sc2cmeargp5dtogdjtvqbmuy
« Previous Showing results 1 — 15 out of 3,718 results