Go home now Header Background Image
Search
Submission Procedure
share: |
 
Follow us
 
 
 
 
Volume 15 / Issue 14

available in:   PDF (266 kB) PS (481 kB)
 
get:  
Similar Docs BibTeX   Write a comment
  
get:  
Links into Future
 
DOI:   10.3217/jucs-015-14-2808

 

Petri Net Controlled Grammars: the Case of Special Petri Nets

J├╝rgen Dassow (Otto-von-Guericke-Universit├Ąt Magdeburg, Germany)

Sherzod Turaev (Universiti Putra Malaysia, Malaysia)

Abstract: A Petri net controlled grammar is a context-free grammar equipped with a Petri net, whose transitions are labeled with rules of the grammar or the empty string, and the associated language consists of all terminal strings which can be derived in the grammar and the the sequence of rules in every terminal derivation corresponds to some occurrence sequence of transitions of the Petri net which is enabled at the initial marking and finished at a final marking of the net. We present some results on the generative capacity of such grammars so that the associated Petri nets are restricted to some known special classes of Petri nets.

Keywords: Petri net controlled grammars, Petri nets, grammars, grammars with regulated rewriting

Categories: F.4.2, F.4.3