On Modifying High Level Replacement Systems1 1Partially supported by the European Community under TMR GETGRATS and Esprit WG APPLIGRAPH

DOI10.1016/S1571-0661(04)80940-XzbMath1263.68091MaRDI QIDQ4923505

Francesco Parisi-Presicce

Publication date: 24 May 2013

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

zbMATH Keywords

evolutionalgebraic formalismsrule-base specifications

Mathematics Subject Classification ID

Specification and verification (program logics, model checking, etc.) (68Q60) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85) Grammars and rewriting systems (68Q42)

Related Items (1)

Rule-based transformation of graph rewriting rules: towards higher-order graph grammars

Cites Work

• Parallelism and concurrency in high-level replacement systems
• Transformations of graph grammars
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: On Modifying High Level Replacement Systems1 1Partially supported by the European Community under TMR GETGRATS and Esprit WG APPLIGRAPH