On the Complexity of Concurrent Multiset Rewriting

DOI10.1142/S0129054116500052zbMath1339.68109MaRDI QIDQ2806558

Marin Bertier, Cédric Tedeschi, Matthieu Perrin

Publication date: 18 May 2016

Published in: International Journal of Foundations of Computer Science (Search for Journal in Brave)

zbMATH Keywords

complexityconcurrencyrule-based programmingmultiset rewriting

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85) Grammars and rewriting systems (68Q42)

Cites Work

• Message delay and DisCSP search algorithms
• Shared memory implementation of the gamma-operation
• An Algorithm for Subgraph Isomorphism
• Constraint satisfaction algorithms for graph pattern matching
• Generalised multisets for chemical programming

This page was built for publication: On the Complexity of Concurrent Multiset Rewriting