栈结构的增广Petri网模型  

The Extened Petri net Model of Stack

作　　者：李莹莹[1] 吴哲辉[1] 

机构地区：[1]山东科技大学信息科学与工程学院,山东青岛266510

出　　处：《系统仿真学报》2007年第A01期124-128,共5页Journal of System Simulation

基　　金：国家自然科学基金(60673053;60603090);山东省优秀中青年科学家奖励基金(2006BS01019)

摘　　要：增广Petri网(如抑止弧Petri网)的模拟能力相当于图灵机,堆栈是一种常见的数据结构,运用增广Petri网的强大模拟能力,通过用一个变迁序列表示入栈字符串,另一个变迁序列表示出栈字符串,可以建立堆栈结构的模型SEPN。利用SEPN模型和映射函数,给出了产生几种上下文无关语言的有限长子集的增广Petri网模型,这几种语言是不能由一般的Petri网产生的。The simulation ability of extended Petri net （such as Petri net with inhibitor） is equivalent to Turing machine. Stack is a common data structure. With the powerful simulation capability of the extended Petri net, a model （called SEPN） for stack be established by using a sequence of transition to express the string which going into the stack, another sequence of transition to express the string which going out of the stack . Several extened Petri net models for a subset of the context-free language with limit length, which can not be producted by normal Petri net, were established with the SEPN model.

关 键 词：增广PETRI网 堆栈 模型 上下文无关语言 

分 类 号：TP391.9[自动化与计算机技术—计算机应用技术]