Basic Results for Two Types of High-Level Replacement Systems

DOI10.1016/S1571-0661(04)80197-XzbMath1263.68073OpenAlexW2030988776MaRDI QIDQ4923535

No author found.

Publication date: 24 May 2013

Published in: Electronic Notes in Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s1571-0661(04)80197-x

Mathematics Subject Classification ID

Grammars and rewriting systems (68Q42) Limits and colimits (products, sums, directed limits, pushouts, fiber products, equalizers, kernels, ends and coends, etc.) (18A30)

Related Items (1)

GETGRATS

Cites Work

• Petri nets are monoids
• Double-pushout graph transformation revisited
• Parallelism and concurrency in high-level replacement systems
• Algebraic high-level net transformation systems
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Basic Results for Two Types of High-Level Replacement Systems