Equivalence and independence in controlled graph-rewriting processes

DOI10.1007/978-3-319-92991-0_9zbMath1394.68199OpenAlexW2805724896MaRDI QIDQ1663987

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

Publication date: 24 August 2018

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

Mathematics Subject Classification ID

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

Related Items (2)

A calculus of concurrent graph-rewriting processes ⋮ A tale of two graph models: a case study in wireless sensor networks

Uses Software

• eMoflon

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