The Structure of Concurrent Process Histories

Author(s):  
Chad Nester
Keyword(s):  
1994 ◽  
Vol 19 (2) ◽  
pp. 38-51 ◽  
Author(s):  
Alan M. Davis ◽  
Pradip Sitaram

1975 ◽  
Vol 18 (4) ◽  
pp. 375-379 ◽  
Author(s):  
S. K. Shrivastava
Keyword(s):  

2014 ◽  
Vol 668-669 ◽  
pp. 1651-1654
Author(s):  
Yan Hai Chen ◽  
Hai Feng Li ◽  
Jing Xu ◽  
Fu Sheng Qiu ◽  
Gong Dong Wang

In order to make a rational planning of CAPP-PPC process, the differences of product serial and concurrent CAPP-PPC process were studyed in this paper. Based on Witness, Three kinds of product serial and concurrent CAPP-PPC process simulation model were established for products with different complicated degrees. Simulation results show the time of concurrent process is much shorter than serial process, for complex products, especially obvious.


2015 ◽  
Vol 743 ◽  
pp. 575-580
Author(s):  
B.W. Liu

Distributed system has the characteristic of high concurrency, which often leads to deadlock due to the execution of concurrent process. By applying Petri nets model can effectively solve this problem. In this paper, based on Petri nets model, we propose a new efficient deadlock avoidance policy for distributed system by using the Petri reachability graph. At last we analysis the different performance between this algorithm and the traditional method by using Matlab tool.


Sign in / Sign up

Export Citation Format

Share Document