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...

Full description

Bibliographic Details
Main Authors: Mohamad Jan, Nurhidaya, Turaev, Sherzod, Fong, Wan Heng, Sarmin, Nor Haniza
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
id iium-53717
recordtype eprints
spelling iium-537172017-01-01T17:11:05Z http://irep.iium.edu.my/53717/ Place-Labeled Petri Net Controlled Grammars Mohamad Jan, Nurhidaya Turaev, Sherzod Fong, Wan Heng Sarmin, Nor Haniza QA Mathematics QA75 Electronic computers. Computer science 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. Science Society of Thailand under Royal Patronage 2016 Article PeerReviewed application/pdf en http://irep.iium.edu.my/53717/1/SCIAS_%28ICCEMS%29.pdf Mohamad Jan, Nurhidaya and Turaev, Sherzod and Fong, Wan Heng and Sarmin, Nor Haniza (2016) Place-Labeled Petri Net Controlled Grammars. ScienceAsia. ISSN 1513-1874 (In Press)
repository_type Digital Repository
institution_category Local University
institution International Islamic University Malaysia
building IIUM Repository
collection Online Access
language English
topic QA Mathematics
QA75 Electronic computers. Computer science
spellingShingle QA Mathematics
QA75 Electronic computers. Computer science
Mohamad Jan, Nurhidaya
Turaev, Sherzod
Fong, Wan Heng
Sarmin, Nor Haniza
Place-Labeled Petri Net Controlled Grammars
description 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.
format Article
author Mohamad Jan, Nurhidaya
Turaev, Sherzod
Fong, Wan Heng
Sarmin, Nor Haniza
author_facet Mohamad Jan, Nurhidaya
Turaev, Sherzod
Fong, Wan Heng
Sarmin, Nor Haniza
author_sort Mohamad Jan, Nurhidaya
title Place-Labeled Petri Net Controlled Grammars
title_short Place-Labeled Petri Net Controlled Grammars
title_full Place-Labeled Petri Net Controlled Grammars
title_fullStr Place-Labeled Petri Net Controlled Grammars
title_full_unstemmed Place-Labeled Petri Net Controlled Grammars
title_sort place-labeled petri net controlled grammars
publisher Science Society of Thailand under Royal Patronage
publishDate 2016
url http://irep.iium.edu.my/53717/
http://irep.iium.edu.my/53717/1/SCIAS_%28ICCEMS%29.pdf
first_indexed 2023-09-18T21:15:58Z
last_indexed 2023-09-18T21:15:58Z
_version_ 1777411563836145664