A new variant of Petri net controlled grammars

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

	PDF - Published Version Restricted to Registered users only Download (523kB) | Request a copy
Preview	PDF Download (71kB) | Preview

Abstract

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.

Item Type:	Article (Journal)
Additional Information:	6846/47354
Uncontrolled Keywords:	Petri net, context-free grammar, Petri net controlled grammar, computational power
Subjects:	Q Science > QA Mathematics > QA75 Electronic computers. Computer science
Kulliyyahs/Centres/Divisions/Institutes (Can select more than one option. Press CONTROL button):	Kulliyyah of Information and Communication Technology > Department of Computer Science Kulliyyah of Information and Communication Technology > Department of Computer Science
Depositing User:	Dr. Sherzod Turaev
Date Deposited:	21 Jan 2016 14:25
Last Modified:	07 Sep 2017 11:11
URI:	http://irep.iium.edu.my/id/eprint/47354

Actions (login required)

View Item