Graph Transformations 5th International Conference, ICGT 2010, Enschede, The Netherlands, September 27–October 2, 2010. Proceedings /

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 combi...

Full description

Bibliographic Details
Corporate Author: SpringerLink (Online service)
Other Authors: Ehrig, Hartmut (Editor), Rensink, Arend (Editor), Rozenberg, Grzegorz (Editor), Schürr, Andy (Editor)
Format: Electronic eBook
Language:English
Published: Berlin, Heidelberg : Springer Berlin Heidelberg, 2010.
Series:Lecture Notes in Computer Science, 6372
Subjects:
Online Access:Full Text via HEAL-Link
LEADER 06283nam a22006255i 4500
001 978-3-642-15928-2
003 DE-He213
005 20151204145619.0
007 cr nn 008mamaa
008 100920s2010 gw | s |||| 0|eng d
020 |a 9783642159282  |9 978-3-642-15928-2 
024 7 |a 10.1007/978-3-642-15928-2  |2 doi 
040 |d GrThAP 
050 4 |a QA76.9.M35 
072 7 |a PBD  |2 bicssc 
072 7 |a UYAM  |2 bicssc 
072 7 |a COM018000  |2 bisacsh 
072 7 |a MAT008000  |2 bisacsh 
082 0 4 |a 004.0151  |2 23 
245 1 0 |a Graph Transformations  |h [electronic resource] :  |b 5th International Conference, ICGT 2010, Enschede, The Netherlands, September 27–October 2, 2010. Proceedings /  |c edited by Hartmut Ehrig, Arend Rensink, Grzegorz Rozenberg, Andy Schürr. 
264 1 |a Berlin, Heidelberg :  |b Springer Berlin Heidelberg,  |c 2010. 
300 |a XII, 419 p.  |b online resource. 
336 |a text  |b txt  |2 rdacontent 
337 |a computer  |b c  |2 rdamedia 
338 |a online resource  |b cr  |2 rdacarrier 
347 |a text file  |b PDF  |2 rda 
490 1 |a Lecture Notes in Computer Science,  |x 0302-9743 ;  |v 6372 
505 0 |a Invited Speakers -- A False History of True Concurrency: From Petri to Tools -- How Far Can Enterprise Modeling for Banking Be Supported by Graph Transformation? -- Session 1. Graphs and Logic -- Graph Transformation Units Guided by a SAT Solver -- Delaying Constraint Solving in Symbolic Graph Transformation -- A Dynamic Logic for Termgraph Rewriting -- Session 2. Behavioural Analysis -- A New Type of Behaviour-Preserving Transition Insertions in Unfolding Prefixes -- On the Computation of McMillan’s Prefix for Contextual Nets and Graph Grammars -- Verification of Graph Transformation Systems with Context-Free Specifications -- Saturated LTSs for Adhesive Rewriting Systems -- A Hoare Calculus for Graph Programs -- Session 3. Models and Model Transformation -- Formal Analysis of Functional Behaviour for Model Transformations Based on Triple Graph Grammars -- Conflict Detection for Model Versioning Based on Graph Modifications -- A Component Concept for Typed Graphs with Inheritance and Containment Structures -- Combining Termination Criteria by Isolating Deletion -- Session 4. Algebraic Foundations -- Graph Rewriting in Span-Categories -- Finitary -Adhesive Categories -- Hereditary Pushouts Reconsidered -- Session 5. Applications -- Graph Transformation for Domain-Specific Discrete Event Time Simulation -- Counterpart Semantics for a Second-Order ?-Calculus -- Declarative Mesh Subdivision Using Topological Rewriting in MGS -- A Model for Distribution and Revocation of Certificates -- Session 6. Rule Composition -- Local Confluence for Rules with Nested Application Conditions -- Multi-Amalgamation in Adhesive Categories -- Amalgamating Pushout and Pullback Graph Transformation in Collagories -- Doctoral Symposium -- ICGT 2010 Doctoral Symposium -- EMF Model Transformation Based on Graph Transformation: Formal Foundation and Tool Environment -- Recognizable Graph Languages for the Verification of Dynamic Systems -- Stochastic Modelling and Simulation of Dynamic Resource Allocation -- Bisimulation Theory for Graph Transformation Systems -- Realizing Impure Functions in Interaction Nets -- Composite EMF Modeling Based on Typed Graphs with Inheritance and Containment Structures -- Formal Modeling and Analysis of Communication Platforms Like Skype Based on Petri Net Transformation Systems -- LTS Semantics for Process Calculi from Their Graphical Encodings -- Automated Assistance for Search-Based Refactoring Using Unfolding of Graph Transformation Systems -- Correctness of Graph Programs Relative to HR?+? Conditions -- Static Type Checking of Model Transformation Programs -- Using Graph Transformations and Graph Abstractions for Software Verification. 
520 |a 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. 
650 0 |a Computer science. 
650 0 |a Software engineering. 
650 0 |a Data structures (Computer science). 
650 0 |a Algorithms. 
650 0 |a Computer logic. 
650 0 |a Mathematical logic. 
650 0 |a Computer science  |x Mathematics. 
650 1 4 |a Computer Science. 
650 2 4 |a Discrete Mathematics in Computer Science. 
650 2 4 |a Software Engineering. 
650 2 4 |a Data Structures. 
650 2 4 |a Logics and Meanings of Programs. 
650 2 4 |a Algorithm Analysis and Problem Complexity. 
650 2 4 |a Mathematical Logic and Formal Languages. 
700 1 |a Ehrig, Hartmut.  |e editor. 
700 1 |a Rensink, Arend.  |e editor. 
700 1 |a Rozenberg, Grzegorz.  |e editor. 
700 1 |a Schürr, Andy.  |e editor. 
710 2 |a SpringerLink (Online service) 
773 0 |t Springer eBooks 
776 0 8 |i Printed edition:  |z 9783642159275 
830 0 |a Lecture Notes in Computer Science,  |x 0302-9743 ;  |v 6372 
856 4 0 |u http://dx.doi.org/10.1007/978-3-642-15928-2  |z Full Text via HEAL-Link 
912 |a ZDB-2-SCS 
912 |a ZDB-2-LNC 
950 |a Computer Science (Springer-11645)