Place-Labeled Petri Net Controlled Grammars
A place-labeled Petri net (pPN) controlled grammar is a context-free grammar equipped with a Petri net and a function which maps places of the net to the productions of the grammar. The language consists of all terminal strings that can be obtained by simultaneously applying of the rules of multiset...
| Main Authors: | , , , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Science Society of Thailand under Royal Patronage
2016
|
| Subjects: | |
| Online Access: | http://irep.iium.edu.my/53717/ http://irep.iium.edu.my/53717/1/SCIAS_%28ICCEMS%29.pdf |
| Summary: | A place-labeled Petri net (pPN) controlled grammar is a context-free grammar equipped with a Petri net and a function which maps places of the net to the productions of the grammar. The language consists of all terminal strings that can be obtained by simultaneously applying of the rules of multisets which are the images of the sets of the input places of transitions in a successful occurrence sequence of the Petri net. In this paper, we study the generative power and structural properties of pPN controlled grammars. We show that pPN controlled grammars have the same generative power as matrix grammars. Moreover, we prove that for each pPN controlled grammar, we can construct an equivalent place-labeled ordinary net controlled grammar. |
|---|