Depth Boundedness in Multiset Rewriting Systems with Name Binding
From MaRDI portal
Publication:3584968
DOI10.1007/978-3-642-15349-5_11zbMath1287.68086OpenAlexW1551972907WikidataQ57831219 ScholiaQ57831219MaRDI QIDQ3584968
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
Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85) Grammars and rewriting systems (68Q42)
Related Items (2)
Linear equations for unordered data vectors in $[D^k\to{}Z^d$] ⋮ 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
