Double-pullback graph transitions: A rule-based framework with incomplete information

DOI10.1007/978-3-540-46464-8_7MaRDI QIDQ4502807zbMATH OpenFDO

Authors Hartmut Ehrig, R. Heckel, Mercè Llabrés, Fernando Orejas, J. Padberg, Grzegorz Rozenberg

Publication date 19 April 2001

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-540-46464-8_7

zbMATH Keywords

graph transformationPetri netsreactive systems

Mathematics Subject Classification ID

Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Recommendations

• Abstract graph derivations in the double pushout approach
• Double-pullback transitions and coalgebraic loose semantics for graph transformation systems
• Double-pushout graph transformation revisited
• Graphs, Rewriting and Pathway Reconstruction for Rule-Based Models
• Rules Dependencies in Backward Chaining of Conceptual Graphs Rules
• Graphs and decidable transductions based on edge constraints
• Reachability relations and the structure of transitive digraphs
• Deriving graphs with a retracting-free bidirectional double tracing
• From imperative to rule-based graph programs
• Incomplete inference for graph problems

Cited in

(2)

• An institution for graph transformation
• GETGRATS: a summary of scientific results (with annotated bibliography)

This page was built for publication: Double-pullback graph transitions: A rule-based framework with incomplete information

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4502807)