Graph rewriting systems with priorities

DOI10.1007/3-540-52292-1_7MaRDI QIDQ4694746zbMATH OpenFDO

Authors Michel Billaud, P. Lafon, Éric Sopena, Yves Métivier

Publication date 29 June 1993

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

Full work available at URL https://doi.org/10.1007/3-540-52292-1_7

zbMATH Keywords

attribute graph rewriting systemsdistributed algorithms

Mathematics Subject Classification ID

Trees (05C05) Grammars and rewriting systems (68Q42) Graph theory (including graph drawing) in computer science (68R10) Distributed algorithms (68W15)

Recommendations

• scientific article; zbMATH DE number 475415
• Computing with graph rewriting systems with priorities
• Concurrent graph and term graph rewriting
• Attributed graph rewriting system
• scientific article; zbMATH DE number 4049097

Cited in

(10)

• Comparison of two graph-rewrite systems
• Computing with graph rewriting systems with priorities
• Checking Global Graph Properties by Means of Local Computations: the Majority Problem
• scientific article; zbMATH DE number 475415 (Why is no real title available?)
• Different local controls for graph relabeling systems
• Graph rewriting systems and their application to network reliability analysis
• Attributed graph rewriting system
• Definitions and comparisons of local computations on graphs (extended abstract)
• Concurrent graph and term graph rewriting
• Some undecidable termination problems for semi-Thue systems

This page was built for publication: Graph rewriting systems with priorities

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