|国家科技期刊平台
| 注册
首页|期刊导航|自动化学报（英文版）|A Reduced Reachability Tree for a Class of Unbounded Petri Nets

A Reduced Reachability Tree for a Class of Unbounded Petri Nets

Shouguang Wang Mengdi Gan Mengchu Zhou Dan You

自动化学报（英文版）2015，Vol.2Issue(4)：345-352,8.
✕
自动化学报（英文版）2015，Vol.2Issue(4)：345-352,8.

A Reduced Reachability Tree for a Class of Unbounded Petri Nets

A Reduced Reachability Tree for a Class of Unbounded Petri Nets

Shouguang Wang 1Mengdi Gan 2Mengchu Zhou 3Dan You4

作者信息

  • 1. School of Information and Electronic Engi-neering,Zhejiang Gongshang University,Hangzhou 310018,China
  • 2. State Key Laboratory for Manufacturing Systems Engineering,Xi'an Jiaotong University,Xi'an 710049, China
  • 3. Ministry of Education(MoE) Key Laboratory of Embedded System and Service Computing, Tongji University, Shanghai 200092, China
  • 4. MoE Key Laboratory of Embedded System and Service Computing,Tongji University,Shanghai 200092,China
  • 折叠

摘要

关键词

Petri nets/reachability tree/deadlock

Key words

Petri nets/reachability tree/deadlock

引用本文复制引用

Shouguang Wang,Mengdi Gan,Mengchu Zhou,Dan You..A Reduced Reachability Tree for a Class of Unbounded Petri Nets[J].自动化学报（英文版）,2015,2(4):345-352,8.

基金项目

This work was supported by National Natural Science Foundation of China (61374148, 61472361, 61374005), Natural Science Foundation of Zhejiang Province(LY15F030003,LY15F030002,LR14F020001),the National Science Foundation of USA (CMMI-1162482), the Opening Project of State Key Laboratory for Manufacturing Systems Engineering(sklms2014011),Zhejiang NNST Key Laboratory (2015C31064), and the State Scholarship Fund of China.Recommended by Associate Editor Fei-Yue Wang. （61374148, 61472361, 61374005）

自动化学报（英文版）

OAEI

2329-9266

访问量0
|
下载量0
段落导航相关论文