A new variant of Petri net controlled grammars
A Petri net controlled grammar is a Petri net with respect to a context-free grammar where the successful derivations of the grammar can be simulated using the occurrence sequences of the net. In this paper, we introduce a new variant of Petri net controlled grammars, called a place-labeled Petri ne...
| Main Authors: | , , , |
|---|---|
| Format: | Article |
| Language: | English English |
| Published: |
American Institute of Physics
2015
|
| Subjects: | |
| Online Access: | http://irep.iium.edu.my/47354/ http://irep.iium.edu.my/47354/ http://irep.iium.edu.my/47354/ http://irep.iium.edu.my/47354/1/SKSM22_24-26_Nov_2014_AIP_Conf_Proc_1682_%282015%29_-_Daya_040015_1-11.pdf http://irep.iium.edu.my/47354/4/47354_A%20new%20variant%20of%20Petri%20net%20controlled%20grammars_Scopus.pdf |
| Summary: | A Petri net controlled grammar is a Petri net with respect to a context-free grammar where the successful derivations of the grammar can be simulated using the occurrence sequences of the net. In this paper, we introduce a new variant of Petri net controlled grammars, called a place-labeled Petri net controlled grammar, which is a context-free grammar equipped with a Petri net and a function which maps places of the net to productions of the grammar. The language consists of all terminal strings that can be obtained by parallelly applying multisets of the rules which are the images of the sets of the input places of transitions in a successful occurrence sequence of the Petri net. We study the effect of the different labeling strategies to the computational power and establish lower and upper bounds for the generative capacity of place- labeled Petri net controlled grammars. |
|---|