Depth boundedness in multiset rewriting systems with name binding

DOI10.1007/978-3-642-15349-5_11MaRDI QIDQ3584968zbMATH OpenOpenAlexWikidataFDO

Authors Fernando Rosa-Velardo

Publication date 31 August 2010

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-642-15349-5_11

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
• Multiset Rewriting: A Semantic Framework for Concurrency with Name Binding
• Accelerations for the coverability set of Petri nets with names
• Decidability of safety properties of timed multiset rewriting
• Decidability problems in Petri nets with names and replication

Cited in

(5)

• Multiset Rewriting: A Semantic Framework for Concurrency with Name Binding
• Linear equations for unordered data vectors in $[D]^k\to{}Z^d$
• Decidability of safety properties of timed multiset rewriting
• scientific article; zbMATH DE number 7668098 (Why is no real title available?)
• Multiset rewriting for the verification of depth-bounded processes with name binding

This page was built for publication: Depth boundedness in multiset rewriting systems with name binding

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