Equivalence and independence in controlled graph-rewriting processes

DOI10.1007/978-3-319-92991-0_9MaRDI QIDQ1663987zbMATH OpenOpenAlexFDO

Authors Géza Kulcsár, Andrea Corradini, Malte Lochau

Publication date 24 August 2018

Full work available at URL http://hdl.handle.net/11568/983279

Mathematics Subject Classification ID

Grammars and rewriting systems (68Q42) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Recommendations

• A calculus of concurrent graph-rewriting processes
• Graph-rewriting Petri nets
• scientific article; zbMATH DE number 7020157
• Publication:4890710
• Algebraic graph rewriting with controlled embedding

Cited in

(6)

• A calculus of concurrent graph-rewriting processes
• scientific article; zbMATH DE number 1231489 (Why is no real title available?)
• Graph-rewriting Petri nets
• A tale of two graph models: a case study in wireless sensor networks
• A foundation for functional graph programs: the \textit{graph transformation control algebra} (GTA)
• Graph Transactions as Processes

Describes a project that uses

Uses Software

• eMoflon

This page was built for publication: Equivalence and independence in controlled graph-rewriting processes

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