Graph-rewriting Petri nets

DOI10.1007/978-3-319-92991-0_6zbMATH Open1394.68253OpenAlexW2807109271MaRDI QIDQ1663983FDOQ1663983

Andy Schürr, Malte Lochau, Géza Kulcsár

Publication date: 24 August 2018

Full work available at URL: https://doi.org/10.1007/978-3-319-92991-0_6

Recommendations

• A calculus of concurrent graph-rewriting processes
• Concurrent graph and term graph rewriting
• Equivalence and independence in controlled graph-rewriting processes
• scientific article; zbMATH DE number 1762783
• scientific article

Mathematics Subject Classification ID

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

Cited In (7)

• Petri net representation of multi-valued logical regulatory graphs
• On the Petri net realization of context-free graphs
• A structural approach to graph transformation based on symmetric Petri nets
• Representation and Execution of Petri Nets Using Rewriting Logic as a Unifying Framework
• Graphs, Rewriting and Pathway Reconstruction for Rule-Based Models
• Lectures on Concurrency and Petri Nets
• A tale of two graph models: a case study in wireless sensor networks

This page was built for publication: Graph-rewriting Petri nets

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