Confluence of Graph Transformation Revisited

It is shown that it is undecidable in general whether a terminating graph rewriting system is confluent or not—in contrast to the situation for term and string rewriting systems. Critical pairs are introduced to hypergraph rewriting, a generalisation of graph rewriting, where it turns out that the m...

Full description

Saved in:
Bibliographic Details
Published inProcesses, Terms and Cycles: Steps on the Road to Infinity pp. 280 - 308
Main Author Plump, Detlef
Format Book Chapter
LanguageEnglish
Published Berlin, Heidelberg Springer Berlin Heidelberg 2005
SeriesLecture Notes in Computer Science
Subjects
Online AccessGet full text
ISBN354030911X
9783540309116
ISSN0302-9743
1611-3349
DOI10.1007/11601548_16

Cover

Abstract It is shown that it is undecidable in general whether a terminating graph rewriting system is confluent or not—in contrast to the situation for term and string rewriting systems. Critical pairs are introduced to hypergraph rewriting, a generalisation of graph rewriting, where it turns out that the mere existence of common reducts for all critical pairs of a graph rewriting system does not imply local confluence. A Critical Pair Lemma for hypergraph rewriting is then established which guarantees local confluence if each critical pair of a system has joining derivations that are compatible in that they map certain nodes to the same nodes in the common reduct.
AbstractList It is shown that it is undecidable in general whether a terminating graph rewriting system is confluent or not—in contrast to the situation for term and string rewriting systems. Critical pairs are introduced to hypergraph rewriting, a generalisation of graph rewriting, where it turns out that the mere existence of common reducts for all critical pairs of a graph rewriting system does not imply local confluence. A Critical Pair Lemma for hypergraph rewriting is then established which guarantees local confluence if each critical pair of a system has joining derivations that are compatible in that they map certain nodes to the same nodes in the common reduct.
Author Plump, Detlef
Author_xml – sequence: 1
  givenname: Detlef
  surname: Plump
  fullname: Plump, Detlef
  email: det@cs.york.ac.uk
  organization: Department of Computer Science, The University of York, York, United Kingdom
BookMark eNpNkE1LxDAYhF91BbtrT_6BXgWr79uk-ThKWVdhQZAVvJWkTbS6Jkuz-vutHwefy8wwMIeZwyzE4ADOCC8JUV4RCaSaq5bEAeRaKlZzZBWvanEIGQmikjGuj2D-U6AmeppBNrmq1JKzE8hTesUJRrpWOoOLJga__XChc0X0xWo0u5diM5qQfBzfzX6IoXhwn0Ma9q4_hWNvtsnlf7qAx5vlprkt1_eru-Z6XSZCLkrvPFpdeV1bKbklboXuVF8Jwa31Rhukbkrad8z3BrHqFJJC2Vvn5QRbwPnvbtqNQ3h2Y2tjfEstYft9Q_vvBvYFydZLVA
ContentType Book Chapter
Copyright Springer-Verlag Berlin Heidelberg 2005
Copyright_xml – notice: Springer-Verlag Berlin Heidelberg 2005
DOI 10.1007/11601548_16
DatabaseTitleList
DeliveryMethod fulltext_linktorsrc
Discipline Mathematics
Computer Science
EISBN 9783540324256
3540324259
EISSN 1611-3349
Editor van Oostrom, Vincent
van Raamsdonk, Femke
de Vrijer, Roel
Middeldorp, Aart
Editor_xml – sequence: 1
  givenname: Aart
  surname: Middeldorp
  fullname: Middeldorp, Aart
  email: aart.middeldorp@uibk.ac.at
– sequence: 2
  givenname: Vincent
  surname: van Oostrom
  fullname: van Oostrom, Vincent
  email: Vincent.vanOostrom@phil.uu.nl
– sequence: 3
  givenname: Femke
  surname: van Raamsdonk
  fullname: van Raamsdonk, Femke
  email: femke@few.vu.nl
– sequence: 4
  givenname: Roel
  surname: de Vrijer
  fullname: de Vrijer, Roel
  email: rdv@cs.vu.nl
EndPage 308
GroupedDBID -DT
-GH
-~X
1SB
29L
2HA
2HV
5QI
875
AASHB
ABMNI
ACGFS
ADCXD
AEFIE
ALMA_UNASSIGNED_HOLDINGS
EJD
F5P
FEDTE
HVGLF
LAS
LDH
P2P
RNI
RSU
SVGTG
VI1
~02
ID FETCH-LOGICAL-s1046-fef0b92f95b774b14b69c8d2664bbfa9a01cd269fc3fda002c801807dbef77773
ISBN 354030911X
9783540309116
ISSN 0302-9743
IngestDate Wed Sep 17 02:17:31 EDT 2025
IsPeerReviewed true
IsScholarly true
Language English
LinkModel OpenURL
MergedId FETCHMERGED-LOGICAL-s1046-fef0b92f95b774b14b69c8d2664bbfa9a01cd269fc3fda002c801807dbef77773
PageCount 29
ParticipantIDs springer_books_10_1007_11601548_16
PublicationCentury 2000
PublicationDate 2005
PublicationDateYYYYMMDD 2005-01-01
PublicationDate_xml – year: 2005
  text: 2005
PublicationDecade 2000
PublicationPlace Berlin, Heidelberg
PublicationPlace_xml – name: Berlin, Heidelberg
PublicationSeriesTitle Lecture Notes in Computer Science
PublicationSubtitle Essays Dedicated to Jan Willem Klop on the Occasion of His 60th Birthday
PublicationTitle Processes, Terms and Cycles: Steps on the Road to Infinity
PublicationYear 2005
Publisher Springer Berlin Heidelberg
Publisher_xml – name: Springer Berlin Heidelberg
RelatedPersons Kleinberg, Jon M.
Mattern, Friedemann
Nierstrasz, Oscar
Tygar, Dough
Steffen, Bernhard
Kittler, Josef
Vardi, Moshe Y.
Weikum, Gerhard
Sudan, Madhu
Naor, Moni
Mitchell, John C.
Terzopoulos, Demetri
Pandu Rangan, C.
Kanade, Takeo
Hutchison, David
RelatedPersons_xml – sequence: 1
  givenname: David
  surname: Hutchison
  fullname: Hutchison, David
  organization: Lancaster University, UK
– sequence: 2
  givenname: Takeo
  surname: Kanade
  fullname: Kanade, Takeo
  organization: Carnegie Mellon University, Pittsburgh, USA
– sequence: 3
  givenname: Josef
  surname: Kittler
  fullname: Kittler, Josef
  organization: University of Surrey, Guildford, UK
– sequence: 4
  givenname: Jon M.
  surname: Kleinberg
  fullname: Kleinberg, Jon M.
  organization: Cornell University, Ithaca, USA
– sequence: 5
  givenname: Friedemann
  surname: Mattern
  fullname: Mattern, Friedemann
  organization: ETH Zurich, Switzerland
– sequence: 6
  givenname: John C.
  surname: Mitchell
  fullname: Mitchell, John C.
  organization: Stanford University, CA, USA
– sequence: 7
  givenname: Moni
  surname: Naor
  fullname: Naor, Moni
  organization: Weizmann Institute of Science, Rehovot, Israel
– sequence: 8
  givenname: Oscar
  surname: Nierstrasz
  fullname: Nierstrasz, Oscar
  organization: University of Bern, Switzerland
– sequence: 9
  givenname: C.
  surname: Pandu Rangan
  fullname: Pandu Rangan, C.
  organization: Indian Institute of Technology, Madras, India
– sequence: 10
  givenname: Bernhard
  surname: Steffen
  fullname: Steffen, Bernhard
  organization: University of Dortmund, Germany
– sequence: 11
  givenname: Madhu
  surname: Sudan
  fullname: Sudan, Madhu
  organization: Massachusetts Institute of Technology, MA, USA
– sequence: 12
  givenname: Demetri
  surname: Terzopoulos
  fullname: Terzopoulos, Demetri
  organization: New York University, NY, USA
– sequence: 13
  givenname: Dough
  surname: Tygar
  fullname: Tygar, Dough
  organization: University of California, Berkeley, USA
– sequence: 14
  givenname: Moshe Y.
  surname: Vardi
  fullname: Vardi, Moshe Y.
  organization: Rice University, Houston, USA
– sequence: 15
  givenname: Gerhard
  surname: Weikum
  fullname: Weikum, Gerhard
  organization: Max-Planck Institute of Computer Science, Saarbruecken, Germany
SSID ssj0000319589
ssj0002792
Score 1.8917993
Snippet It is shown that it is undecidable in general whether a terminating graph rewriting system is confluent or not—in contrast to the situation for term and string...
SourceID springer
SourceType Publisher
StartPage 280
SubjectTerms Critical Pair
Direct Derivation
Graph Grammar
Graph Transformation
Rule Schema
Title Confluence of Graph Transformation Revisited
URI http://link.springer.com/10.1007/11601548_16
hasFullText 1
inHoldings 1
isFullTextHit
isPrint
link http://utb.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwnV1LT4NAEN7YelEPatX4DjHeKgbK8jp4ME21Nm1jTGt6a1jYTbyAETzor3eG3aUvY1QOhJIGlpllmJ2Z7xtCLp2Y2rHnUpNxW5hUhIEZxJFteq2WlYgIVggc8c6Dodcd097Enehe7QpdUrDr-PNbXMl_tArnQK-Ikv2DZquLwgk4Bv3CHjQM-yXndzHMKkkvZIm_fM1HYGAl23L7Q9e5YQGXTgY0n7IoQT_zIRUv8BZXgfRHME6v0vDARcX8DEIwoGxggh7lPTJbSy70CvBYZhbyCiCFz8zzm75KSwyzoqz2aurOEdqQLEQa3KVIg440Nn8g4lKBJAe8EAmh1NgssLuwcpGmjEtT6yGBoiMJS7X5lF2d1JfYKRkfVo28rOuAG5Trrant1UjN98G8rd92ev3nKsSGAC0XyfTVhxm5EmVSSQ5GQX3KwSoyptngFZYTYZZzd1rJl5duyGiHbCE0xUDMCIhzl6zxtEG2tXgNJd4G2RxUZLz5HrmaKdLIhFEq0lhUpFEpcp-M7zqjdtdUTTLMHNPzpuDCYmFLhC4DT57ZlHlhHCTgd1HGRBRGlh3Dr1DEjkgiEEIcIGebnzAufNicA1JPs5QfEiOJvADzwJT7AY08PwR5BRZ3sJEReMb2EbnQDz_FaZ9PNef1nISOf_OnE7Ixm2CnpF68vfMzcO4Kdq6U-AVTHUYp
linkProvider Library Specific Holdings
openUrl ctx_ver=Z39.88-2004&ctx_enc=info%3Aofi%2Fenc%3AUTF-8&rfr_id=info%3Asid%2Fsummon.serialssolutions.com&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Abook&rft.genre=bookitem&rft.title=Processes%2C+Terms+and+Cycles%3A+Steps+on+the+Road+to+Infinity&rft.au=Plump%2C+Detlef&rft.atitle=Confluence+of+Graph+Transformation+Revisited&rft.series=Lecture+Notes+in+Computer+Science&rft.date=2005-01-01&rft.pub=Springer+Berlin+Heidelberg&rft.isbn=9783540309116&rft.issn=0302-9743&rft.eissn=1611-3349&rft.spage=280&rft.epage=308&rft_id=info:doi/10.1007%2F11601548_16
thumbnail_l http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=0302-9743&client=summon
thumbnail_m http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=0302-9743&client=summon
thumbnail_s http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=0302-9743&client=summon