Multiset Rewriting: A Semantic Framework for Concurrency with Name Binding

DOI10.1007/978-3-642-16310-4_13MaRDI QIDQ4933286zbMATH OpenOpenAlexDBLPWikidataFDO

Authors Fernando Rosa-Velardo

Publication date 12 October 2010

Published in Rewriting Logic and Its Applications (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-642-16310-4_13

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

• Multiset rewriting for the verification of depth-bounded processes with name binding
• On the complexity of concurrent multiset rewriting
• Membrane Computing
• Depth boundedness in multiset rewriting systems with name binding
• Rewriting logic as a semantic framework for concurrency: a progress report
• scientific article; zbMATH DE number 7453087
• Maximally parallel probabilistic semantics for multiset rewriting
• Aggregating parallel multiset rewriting systems
• Relation-based semantics for concurrency
• scientific article; zbMATH DE number 92601

Cited in

(3)

• On the complexity of concurrent multiset rewriting
• Depth boundedness in multiset rewriting systems with name binding
• Multiset rewriting for the verification of depth-bounded processes with name binding

This page was built for publication: Multiset Rewriting: A Semantic Framework for Concurrency with Name Binding

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