QQ客服 官方微博 反馈留言

	Reachability determination in acyclic Petri nets by cell enumeration approach
	Li, Duan[1]; Sun, Xiaoling[2]; Gao, Jianjun[3]; Gu, Shenshen[4]; Zheng, Xiaojin[5]
刊名	AUTOMATICA
	2011
卷号	47页码:2094-2098
关键词	Petri nets Reachability analysis Cell enumeration Linear Diophantine equations on bounded integer set
ISSN号	0005-1098
URL标识	查看原文
内容类型	期刊论文
URI标识	http://www.corc.org.cn/handle/1471x/2302313
专题	上海大学
作者单位	1.[1]Chinese Univ Hong Kong, Dept Syst Engn & Engn Management, Shatin, Hong Kong, Peoples R China. 2.[2]Fudan Univ, Dept Management Sci, Sch Management, Shanghai 200433, Peoples R China. 3.[3]Chinese Univ Hong Kong, Dept Syst Engn & Engn Management, Shatin, Hong Kong, Peoples R China. 4.[4]Shanghai Univ, Sch Mechatron Engn & Automat, Shanghai, Peoples R China. 5.[5]Tongji Univ, Sch Econ & Management, Shanghai 200092, Peoples R China.
推荐引用方式 GB/T 7714	Li, Duan[1],Sun, Xiaoling[2],Gao, Jianjun[3],et al. Reachability determination in acyclic Petri nets by cell enumeration approach[J]. AUTOMATICA,2011,47:2094-2098.
APA	Li, Duan[1],Sun, Xiaoling[2],Gao, Jianjun[3],Gu, Shenshen[4],&Zheng, Xiaojin[5].(2011).Reachability determination in acyclic Petri nets by cell enumeration approach.AUTOMATICA,47,2094-2098.
MLA	Li, Duan[1],et al."Reachability determination in acyclic Petri nets by cell enumeration approach".AUTOMATICA 47(2011):2094-2098.

个性服务

查看访问统计

相关权益政策

暂无数据

收藏/分享

除非特别说明，本系统中所有内容都受版权保护，并保留所有权利。