timed petri net
Recently Published Documents


TOTAL DOCUMENTS

169
(FIVE YEARS 12)

H-INDEX

14
(FIVE YEARS 1)

2020 ◽  
Vol 14 (4) ◽  
pp. 4684-4693
Author(s):  
Ruimin Cao ◽  
Lina Hao ◽  
Qiang Gao ◽  
Junxiang Deng ◽  
Jiaming Chen

PLoS ONE ◽  
2020 ◽  
Vol 15 (9) ◽  
pp. e0239685
Author(s):  
Hanwen Liu ◽  
Xiaobing Liu ◽  
Lin Lin ◽  
Sardar M. N. Islam ◽  
Yuqing Xu

10.29007/htqb ◽  
2020 ◽  
Author(s):  
Garrett Hope ◽  
Paul Brodhead ◽  
Seung-yun Kim

Petri nets (PNs) are a form of directed graph that can be used to model and simulate systems. They are very useful tool for developing and analyzing algorithms, prior to implementation. Adding the component of time, allows for systems with prioritized actions to be modeled more effectively. This paper assesses a Texas Hold’em algorithm using Petri nets and uses them to develop an improved version of this algorithm. Both are implemented in Python scripts to obtain the results to show which is more effective.


2020 ◽  
Vol 53 (4) ◽  
pp. 405-410
Author(s):  
Jiacun Wang ◽  
Jun Wang ◽  
Qingtian Zeng ◽  
Gaiyun Liu

Sign in / Sign up

Export Citation Format

Share Document