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

Full description

Bibliographic Details
Main Authors:	Mohamad Jan, Nurhidaya, Turaev, Sherzod, Fong, Wan Heng, Sarmin, Nor Haniza
Format:	Article
Language:	English English
Published:	American Institute of Physics 2015
Subjects:	QA75 Electronic computers. Computer science
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

id	iium-47354
recordtype	eprints
spelling	iium-473542017-09-07T03:11:37Z http://irep.iium.edu.my/47354/ A new variant of Petri net controlled grammars Mohamad Jan, Nurhidaya Turaev, Sherzod Fong, Wan Heng Sarmin, Nor Haniza QA75 Electronic computers. Computer science 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. American Institute of Physics 2015 Article PeerReviewed application/pdf en http://irep.iium.edu.my/47354/1/SKSM22_24-26_Nov_2014_AIP_Conf_Proc_1682_%282015%29_-_Daya_040015_1-11.pdf application/pdf en http://irep.iium.edu.my/47354/4/47354_A%20new%20variant%20of%20Petri%20net%20controlled%20grammars_Scopus.pdf Mohamad Jan, Nurhidaya and Turaev, Sherzod and Fong, Wan Heng and Sarmin, Nor Haniza (2015) A new variant of Petri net controlled grammars. AIP Conference Proceedings, 1682. 040015-1. ISSN 0094-243X E-ISSN 1551-7616 http://scitation.aip.org/content/aip/proceeding/aipcp/10.1063/1.4932488 10.1063/1.4932488
repository_type	Digital Repository
institution_category	Local University
institution	International Islamic University Malaysia
building	IIUM Repository
collection	Online Access
language	English English
topic	QA75 Electronic computers. Computer science
spellingShingle	QA75 Electronic computers. Computer science Mohamad Jan, Nurhidaya Turaev, Sherzod Fong, Wan Heng Sarmin, Nor Haniza A new variant of Petri net controlled grammars
description	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.
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	A new variant of Petri net controlled grammars
title_short	A new variant of Petri net controlled grammars
title_full	A new variant of Petri net controlled grammars
title_fullStr	A new variant of Petri net controlled grammars
title_full_unstemmed	A new variant of Petri net controlled grammars
title_sort	new variant of petri net controlled grammars
publisher	American Institute of Physics
publishDate	2015
url	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
first_indexed	2023-09-18T21:07:24Z
last_indexed	2023-09-18T21:07:24Z
_version_	1777411024804118528

A new variant of Petri net controlled grammars

Similar Items