Graph Transformations: 5th International Conference, ICGT 2010, Twente, The Netherlands, September 27--October 2, 2010, Proceedings
Hartmut Ehrig, Arend Rensink, Grzegorz Rozenberg, Andy Schürr
Springer Science & Business Media, Sep 27, 2010 - Computers - 419 pages
Graphs are among the simplest and most universal models for a variety of s- tems, not just in computer science, but throughout engineering and the life sciences. When systems evolve we are interested in the way they change, to p- dict, support, or react to their evolution. Graph transformation combines the idea of graphs as a universal modelling paradigm with a rule-based approach to specify their evolution. The area is concerned with both the theory of graph transformation and their application to a variety of domains. The biannual International Conferences on Graph Transformation aim at bringingtogetherresearchersandpractitionersinterestedin the foundations and applicationsof graphtransformation.The ?fth conference,ICGT 2010,was held at the University of Twente (The Netherlands) in September/October 2010, alongwith severalsatellite events.It continuedthe line ofconferences previously held in Barcelona (Spain) in 2002, Rome (Italy) 2004, Natal (Brazil) in 2006 and Leicester (UK) in 2008, as well as a series of six International Workshops on Graph Transformation with Applications in Computer Science from 1978 to 1998. Also, ICGT alternates with the workshop series on Application of Graph Transformation with Industrial Relevance (AGTIVE). The conference was held under the auspices of EATCS and EASST.
What people are saying - Write a review
We haven't found any reviews in the usual places.
abstract adhesive categories algebraic algorithm application conditions approach attributed graph bisimulation certiﬁcate component composite conﬁguration conﬂicts conﬂuence constraints construction context corresponding critical pair deﬁned Deﬁnition deletion denoted derivation diﬀerent double pushout dynamic logic Eclipse Modeling Framework edges Ehrig EMF models event example extended places ﬁnitary ﬁnite ﬁrst ﬂow formal formula forward translation rules functor given gluing graph G graph modiﬁcation graph morphisms graph rewriting graph transformation systems IC-graph ICGT inﬁnite initial pushouts interface isomorphism K¨onig labels language Lemma LNCS logic M-adhesive M-morphisms match model checking model transformation monomorphisms NACs node notion object parallel independent Petri net Petri nets preﬁx properties Proposition pullback pullback complement pushout reachable relation Rozenberg satisﬁes semantics sequence speciﬁc Springer structure symbolic graph Taentzer techniques termgraphs Theorem topological transition triple graph grammars triple rules type graph unfolding variables veriﬁcation