Reducibility between classes of port graph grammar.

DOI10.1006/jcss.2002.1814zbMath1059.68054OpenAlexW1976380703MaRDI QIDQ1872703

Charles V. Stewart

Publication date: 14 May 2003

Published in: Journal of Computer and System Sciences (Search for Journal in Brave)

Full work available at URL: https://semanticscholar.org/paper/0eb6149fba5fc1be5cc85dd615c13e855b3e94e1

zbMATH Keywords

concurrent pattern matchingconcurrent rewriting

Mathematics Subject Classification ID

Grammars and rewriting systems (68Q42)

Related Items (1)

Unnamed Item

Uses Software

• AGG

Cites Work

• Handbook of Graph Grammars and Computing by Graph Transformation
• Handbook of Graph Grammars and Computing by Graph Transformation
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Reducibility between classes of port graph grammar.