On the complexity of concurrent multiset rewriting

DOI10.1142/S0129054116500052MaRDI QIDQ2806558zbMATH OpenFDO

Authors Marin Bertier, Matthieu Perrin, Cédric Tedeschi

Publication date 18 May 2016

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

Full work available at URL https://doi.org/10.1142/S0129054116500052

zbMATH Keywords

complexityconcurrencymultiset rewritingrule-based programming

Mathematics Subject Classification ID

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

Recommendations

• Sequential and maximally parallel multiset rewriting: reversibility and determinism
• Reversibility and determinism in sequential multiset rewriting
• Multiset Rewriting: A Semantic Framework for Concurrency with Name Binding
• Minimization strategies for maximally parallel multiset rewriting systems
• Generalised multisets for chemical programming

Cites work

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

Cited in

(6)

• Sequential and maximally parallel multiset rewriting: reversibility and determinism
• Finding a forest in a tree
• Modular multiset rewriting
• Multiset Rewriting: A Semantic Framework for Concurrency with Name Binding
• Monitoring changes in dynamic multiset systems
• Approximate Probabilistic Parallel Multiset Rewriting Using MCMC

This page was built for publication: On the complexity of concurrent multiset rewriting

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