Paper Info
Title
Petri Net Controlled Grammars: the Case of Special Petri Nets
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.
Year
Venue
Keywords
2009
JOURNAL OF UNIVERSAL COMPUTER SCIENCE
grammars,Petri nets,grammars with regulated rewriting,Petri net controlled grammars
Field
DocType
Volume
Rule-based machine translation,Programming language,Petri net,Controlled grammar,Empty string,Computer science,Stochastic Petri net,Grammar,Generative grammar
Journal
15
Issue
ISSN
Citations 
14
0948-695X
3
PageRank 
References 
Authors
0.48
2
2
Name
Order
Citations
PageRank
Jürgen Dassow1530118.27
Sherzod Turaev23110.81