Computer Science ›› 2021, Vol. 48 ›› Issue (11A): 666-668.doi: 10.11896/jsjkx.210100127
• Interdiscipline & Application • Previous Articles Next Articles
LIU Ping
CLC Number:
[1]WU Z H.Theory of Petri Net[M].Beijing:China Machine Press,2006. [2]WU Z H.Process expression of bounded Petri net[J].Science in China album A,1995,25(12):1332-1340. [3]ZENG Q T,WU Z H.Process net system of Petrinet[J].Chinese Journal of Computers,2002,25(12):1308-1315. [4]ZENG Q T,WU Z H.Process expression of un-bounded Petri net[J].Chinese Journal of Computers,2003,26(12):1629-1636. [5]WANG M X,LIU G J,YAN C G.Process Expression of Stable Bounded Petri Nets[J].Computers Science,2011,38(2):55-58. [6]徐关怀.对一个Petri网进程表达式的探讨[J].安徽理工大学学报,2014(3):57-59. [7]ZHOU J Y,YU J,LIU H Y,et al.Deadlock Avoidance Policies of Concurrent Process for Petri Net[J].Computer Technology and Development,2016,26(11):5-9. [8]ZENG Q T.A construction method for the process ex-pression of a Petri net based on synchronization composition[J].Chinese Journal of Computers,2008,31(3):381-390. [9]ZENG Q T,WU Z H.Analgorithm for establishing the set of basic proxess sections for petri net[J].Computer Science,2001,28(7):5-11. [10]HUANG B.Transformation of Petri Net to Process Algebra[J].Computer Products and Circulation,2017(11):1-15. [11]LIU P.The S-cut of currentnets[J].Modern Computer (Pro-fessional Edition),2014(9). |
[1] | LU Chen-yang, DENG Su, MA Wu-bin, WU Ya-hui, ZHOU Hao-hao. Federated Learning Based on Stratified Sampling Optimization for Heterogeneous Clients [J]. Computer Science, 2022, 49(9): 183-193. |
[2] | SHAO Zi-hao, YANG Shi-yu, MA Guo-jie. Foundation of Indoor Information Services:A Survey of Low-cost Localization Techniques [J]. Computer Science, 2022, 49(9): 228-235. |
[3] | ZHANG Yuan, KANG Le, GONG Zhao-hui, ZHANG Zhi-hong. Related Transaction Behavior Detection in Futures Market Based on Bi-LSTM [J]. Computer Science, 2022, 49(7): 31-39. |
[4] | SUN Gang, WU Jiang-jiang, CHEN Hao, LI Jun, XU Shi-yuan. Hidden Preference-based Multi-objective Evolutionary Algorithm Based on Chebyshev Distance [J]. Computer Science, 2022, 49(6): 297-304. |
[5] | WANG Yong, CUI Yuan. Cutting Edge Method for Traveling Salesman Problem Based on the Shortest Paths in Optimal Cycles of Quadrilaterals [J]. Computer Science, 2022, 49(6A): 199-205. |
[6] | LI Dan-dan, WU Yu-xiang, ZHU Cong-cong, LI Zhong-kang. Improved Sparrow Search Algorithm Based on A Variety of Improved Strategies [J]. Computer Science, 2022, 49(6A): 217-222. |
[7] | LU Chen-yang, DENG Su, MA Wu-bin, WU Ya-hui, ZHOU Hao-hao. Clustered Federated Learning Methods Based on DBSCAN Clustering [J]. Computer Science, 2022, 49(6A): 232-237. |
[8] | HU Cong, HE Xiao-hui, SHAO Fa-ming, ZHANG Yan-wu, LU Guan-lin, WANG Jin-kang. Traffic Sign Detection Based on MSERs and SVM [J]. Computer Science, 2022, 49(6A): 325-330. |
[9] | YANG Jian-nan, ZHANG Fan. Classification Method for Small Crops Combining Dual Attention Mechanisms and Hierarchical Network Structure [J]. Computer Science, 2022, 49(6A): 353-357. |
[10] | ZHANG Jia-hao, LIU Feng, QI Jia-yin. Lightweight Micro-expression Recognition Architecture Based on Bottleneck Transformer [J]. Computer Science, 2022, 49(6A): 370-377. |
[11] | WANG Fang-hong, FAN Xing-gang, YANG Jing-jing, ZHOU Jie, WANG De-en. Strong Barrier Construction Algorithm Based on Adjustment of Directional Sensing Area [J]. Computer Science, 2022, 49(6A): 612-618. |
[12] | TIAN Zhen-zhen, JIANG Wei, ZHENG Bing-xu, MENG Li-min. Load Balancing Optimization Scheduling Algorithm Based on Server Cluster [J]. Computer Science, 2022, 49(6A): 639-644. |
[13] | LIU Jian-mei, WANG Hong, MA Zhi. Optimization for Shor's Integer Factorization Algorithm Circuit [J]. Computer Science, 2022, 49(6A): 649-653. |
[14] | CHEN Bo-chen, TANG Wen-bing, HUANG Hong-yun, DING Zuo-hua. Pop-up Obstacles Avoidance for UAV Formation Based on Improved Artificial Potential Field [J]. Computer Science, 2022, 49(6A): 686-693. |
[15] | ZHANG Zhi-long, SHI Xian-jun, QIN Yu-feng. Diagnosis Strategy Optimization Method Based on Improved Quasi Depth Algorithm [J]. Computer Science, 2022, 49(6A): 729-732. |
|