Join-Lock-Sensitive Forward Reachability Analysis for Concurrent Programs with Dynamic Process Creation

2011 ◽  
pp. 199-213 ◽  
Author(s):  
Thomas Martin Gawlitza ◽  
Peter Lammich ◽  
Markus Müller-Olm ◽  
Helmut Seidl ◽  
Alexander Wenner
Keyword(s):  
Dynamic Process ◽  
Reachability Analysis ◽  
Concurrent Programs ◽  
Process Creation

scholarly journals Reachability Analysis of Asynchronous Dynamic Pushdown Networks Based on Tree Semantics Approach

2018 ◽  
Vol 4 (4) ◽  
pp. 287
Author(s):  
Guodong Wu ◽  
Junyan Qian
Keyword(s):  
Reachability Analysis ◽  
Concurrent Programs ◽  
Abstract Model ◽  
Reachability Problem ◽  
Interleaving Semantics ◽  
Recursive Procedures ◽  
Backward Analysis

<em>ADPN (Asynchronous Dynamic Pushdown Networks) are an abstract model for concurrent programs with recursive procedures and dynamic thread creation. Usually, asynchronous dynamic pushdown networks are described with interleaving semantics, in which the backward analysis is not effective. In order to improve interleaving semantics, tree semantics approach was introduced. This paper extends the tree semantics to ADPN. Because the reachability problem of ADPN is also undecidable, we address the context-bounded reachability problem and provide an algorithm for backward reachability analysis with tree-based semantics Approach.</em>

A Generic Petri Net Model for Dynamic Process Planning

1994 ◽  
Author(s):  
Dimitris Kiritsis ◽  
Michel Porchet ◽  
Abdelkader Belhi
Keyword(s):  
Dynamic Model ◽  
Process Planning ◽  
Petri Net ◽  
Dynamic Process ◽  
Reachability Analysis ◽  
Process Plans ◽  
Precedence Relations ◽  
Planning Procedure ◽  
Complete Set ◽  
Manufacturing Knowledge

Abstract In this paper a generic dynamic model for process planning is presented, based on Petri net technology. The proposed Petri net model 1) represents manufacturing knowledge of the type of precedence relations constraints 2) represents dynamically the process planning procedure itself, and 3) encapsulates all possible process planning solutions (process plans). Furthermore, process planning simulation can be performed directly on the Petri net and reachability analysis of the model gives the complete set of solutions (process plans). Then, optimum solutions can be found by using a method based on heuristics.

Sign in / Sign up

Export Citation Format

Share Document