Extended Reachability Graph of Petri Net for Cost Estimation

Author(s):  
Reggie Davidrajuh
Author(s):  
Dimitris Kiritsis ◽  
Paul Xirouchakis

Abstract The problem under consideration is the cost estimation and consequent bid preparation for machined parts subcontracted to mechanical small and medium enterprises (SME). This activity, i.e. cost estimation and corresponding bid preparation, becomes more and more important due to the increasing and globalized competition in this market. There is, therefore, a clear need for precise and accurate cost estimation of machined parts in order for a small company to justify its prices. The proposed prototype software system is based (i) on a manufacturing feature based product description of the part to be machined and (ii) on a non-linear model of its process plan using Petri nets, taking into consideration processing alternatives and precedence constraints, which allows a heuristic based best search of the process plan and, consequently, the corresponding machining time and cost. Product description is done interactively through user friendly interfaces and the corresponding process planning model is constructed automatically in the form of a Petri net. Machine tools and their characteristics are selected from a customized database. Tools and machining parameters are selected through a link with the tool management software TOOL Light©. Minimum time or cost process plans and corresponding bids are reported using the Petri net model of the machined part under consideration and using machining heuristics. The type of parts that are considered in our application are rotational or prismatic parts that are used as components in complex machines like machine tools or automatic assembly machines.


Author(s):  
Dimitris Kiritsis ◽  
Paul Xirouchakis

Abstract The problem under consideration is the modeling of manufacturing resources like machine tools, setups and tools which affect the cost and batch delivery time estimation of machined parts. The proposed resource models are built upon Petri net models for process planning and scheduling with three methods: (i) an implicit modeling method where resources are modeled as a data structure which acts on a specific Process Planning Petri net (PP-net), (ii) a first explicit modeling method where resources, are modeled as separated Petri nets whose places are connected to PP-net transitions with adequate arcs and form a Process Planning Cost System (PPC-system) and (iii) a second explicit modeling method where a two-level Petri net model is proposed which allows the modular modeling of process plans and resources. In the later case, integration is achieved through an synchronization mechanism. The first two methods are used for the cost estimation of process plans of unique parts while the third one is used for delivery time and cost estimation of a batch of machined parts.


2019 ◽  
Vol 2019 ◽  
pp. 1-12 ◽  
Author(s):  
Ter-Chan Row ◽  
Wei-Ming Syu ◽  
Yen-Liang Pan ◽  
Ching-Cheng Wang

This paper focuses on solving deadlock problems of flexible manufacturing systems (FMS) based on Petri nets theory. Precisely, one novel control transition technology is developed to solve FMS deadlock problem. This new proposed technology can not only identify the maximal saturated tokens of idle places in Petri net model (PNM) but also further reserve all original reachable markings whatever they are legal or illegal ones. In other words, once the saturated number of tokens in idle places is identified, the maximal markings of system reachability graph can then be checked. Two classical S3PR (the Systems of Simple Sequential Processes with Resources) examples are used to illustrate the proposed technology. Experimental results indicate that the proposed algorithm of control transition technology seems to be the best one among all existing algorithms.


1999 ◽  
Vol 30 (6) ◽  
pp. 375-387 ◽  
Author(s):  
D Kiritsis ◽  
K.-P Neuendorf ◽  
P Xirouchakis

2011 ◽  
Vol 314-316 ◽  
pp. 535-538
Author(s):  
Yen Liang Pan ◽  
Yi Sheng Huang

Deadlock prevention problem is an important issue in essence for flexible manufacturing systems (FMS). Many works make efforts in the issue. Theory of regions is recognized as one of the powerful deadlock prevention method for obtaining maximally permissive controllers. All legal and live maximal behavior of Petri net models can be preserved by using marking/transition-separation instance (MTSI) or event-state-separation-problem (ESSP) methods. However, solving all sets of inequalities are an extremely time consuming problem since all MTSIs and ESSPs need to be considered in the reachability graph of a deadlock FMS. In our previous work, we propose crucial MTSI (CMTSI) method to improve computational difficulty successfully. In this work, we further enhance the computational efficiency of CMTSI by combining critical markings and CMTSI methods. Experimental results reveal that this approach is more practical than the conventional methods.


Author(s):  
PengCheng Xiong ◽  
Calton Pu ◽  
MengChu Zhou

Protocol-level mismatch is one of the most important problems in service composition. The state-of-the-art method to deal with protocol mismatch is to generate adaptors to check deadlock-freeness based on a reachability graph. When this property is violated, the generation process will repeat itself until no deadlock state is found; however, the main drawback of this method is that it does not take into account the future deadlock state and requires many interactions with a developer. In this regard, it suffers from low efficiency. In this paper, the authors model multiple web service interaction with a Petri net called Composition net (C-net). The protocol-level mismatch problem is transformed into the empty siphon problem of a C-net. The authors take future deadlock states into consideration through this model, while finding the optimal solution that involves fewest interactions with a developer. The proposed method is proved to achieve higher efficiency for resolving protocol-level mismatch issues than traditional ones.


Author(s):  
Dimitris Kiritsis ◽  
Paul Xirouchakis

Abstract The problem under consideration is the cost estimation of part manufacturing while taking into account processing alternatives. In order to determine overall costs for feasible process plans we take into account, in our Petri net model, costs caused by machine, setup and tool changing in addition to the single operation cost. We introduce a new Petri net model that allows the application of incremental cost analysis algorithms. This is a CPP-net (Compact Process Planning net) which represents manufacturing knowledge in the form of precedence constraints and incorporates machining cost, machine, setup and tool information in each transition. We show that the CPP-net allows the calculation of the optimum process plan without the need to first develop all possible solutions. We apply the developed methods and calculate the optimum process plan to an industrial case study of a mechanical workpiece of moderate complexity.


Sign in / Sign up

Export Citation Format

Share Document