scientific article; zbMATH DE number 5790216
From MaRDI portal
Publication:4929333
zbMath1217.68120MaRDI QIDQ4929333
Sherzod Turaev, Juergen Dassow
Publication date: 22 September 2010
Full work available at URL: http://www.jucs.org/jucs_15_14/petri_net_controlled_grammars
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85) Grammars and rewriting systems (68Q42)
Related Items (4)
Earley’s Parsing Algorithm and k-Petri Net Controlled Grammars ⋮ Coverability and Termination in Recursive Petri Nets ⋮ An extended Earley's algorithm for Petri net controlled grammars without \(\lambda\) rules and cyclic rules ⋮ Coverability, Termination, and Finiteness in Recursive Petri Nets
This page was built for publication: