Lean production system design for fishing net manufacturing using lean principles and simulation optimization

Value stream mapping (VSM) is a useful tool for describing the manufacturing state, especially for distinguishing between those activities that add value and those that do not. It can help in eliminating non-value activities and reducing the work in process (WIP) and thereby increase the service level. This research follows the guidelines for designing future state VSM. These guidelines consist of five factors which can be changed simply, without any investment. These five factors are (1) production unit; (2) pacemaker process; (3) number of batches; (4) production sequence; and (5) supermarket size. The five factors are applied to a fishing net manufacturing system. Using experimental design and a simulation optimizing tool, the five factors are optimized. The results show that the future state maps can increase service level and reduce WIP by at least 29.41% and 33.92% respectively. For the present study, the lean principles are innovatively adopted in solving a fishing net manufacturing system which is not a well-addressed problem in literature. In light of the promising empirical results, the proposed methodologies are also readily applicable to similar industries.     

Decomposition of first-order hybrid Petri nets for hierarchical control of manufacturing systems

Although hybrid Petri net (HPN) is a popular formalism in modelling hybrid production systems, the HPN model of large scale systems gets substantially complicated for analysis and control due to large dimensionality of such systems. To overcome this problem, a typical approach is to decompose the net into subnets and then control the plant through hierarchical or decentralized structures. Although this concept has been widely discussed in the literature for discrete PNs, there is a lack of research for HPNs. In this paper, a new method of decomposition of first-order hybrid Petri nets (FOHPNs) is proposed first and then the hierarchical control of the subnets through a coordinator is introduced. The advantage of using the proposed approach is validated by an existing example. A sugar milling case study is analysed by using a decomposed FOHPN model and the optimization results are compared against the results of the approaches presented in other papers. Simulation results show not only an improvement in production rate, but also show the ability to control the plant online. In addition, by using the hierarchical control structure for an FOHPN model, it is possible to reduce the cost of communication links, improve the reliability of the system, maintain the plant locally, and partially redesign the system.     

Model repair — aligning process models to reality

Process mining techniques relate observed behavior (i.e., event logs) to modeled behavior (e.g., a BPMN model or a Petri net). Process models can be discovered from event logs and conformance checking techniques can be used to detect and diagnose differences between observed and modeled behavior. Existing process mining techniques can only uncover these differences, but the actual repair of the model is left to the user and is not supported. In this paper we investigate the problem of repairing a process model w.r.t. a log such that the resulting model can replay the log (i.e., conforms to it) and is as similar as possible to the original model. To solve the problem, we use an existing conformance checker that aligns the runs of the given process model to the traces in the log. Based on this information, we decompose the log into several sublogs of non-fitting subtraces. For each sublog, either a loop is discovered that can replay the sublog or a subprocess is derived that is then added to the original model at the appropriate location. The approach is implemented in the process mining toolkit ProM and has been validated on logs and models from several Dutch municipalities.     

Dreissenid veliger dynamics along a nearshore to offshore transect in Lake Michigan

Dreissenid mussel veligers compose a substantial component of pelagic biomass in the Great Lakes, yet their dynamics are poorly understood. To evaluate seasonal, spatial, and inter-annual variation in veliger density, we used a 64-μm mesh plankton net (2008, 2013–2016) and a 153-μm mesh plankton net (2007–2016) to collect dreissenid veligers at nearshore (15–25?m depth), transitional (45?m) and offshore (93–110?m) sites in southeast Lake Michigan during March–December. We also evaluated trends in density of recently settled mussels relative to veliger abundance and the density of the standing stock of adult mussels. Veliger density peaked during both summer and fall at all sites, but peak densities in summer were generally higher nearshore, whereas peak densities in the fall were generally higher offshore. The density of veligers in the 153-μm net was overall 28% of that in the 64-μm net, but there was high variability in this comparison among months. Smaller veligers were much more abundant in the 64-μm net, but there was little difference in the size distribution and abundance between nets for the 210–300?μm size classes. Thus, the 153-μm net could still be a useful tool for assessing density trends of larger veligers just prior to their settlement. Newly settled mussels (≤2?mm) were most abundant in summer or fall at the nearshore and offshore sites but were nearly absent at the transitional site despite the high density of veligers there. Factors other than veliger density must play an important role in mussel recruitment.     

A Reduced Reachability Tree for a Class of Unbounded Petri Nets

As a powerful analysis tool of Petri nets, reachability trees are fundamental for systematically investigating many characteristics such as boundedness, liveness and reversibility. This work proposes a method to generate a reachability tree, called ωRT for short, for a class of unbounded generalized nets called ω-independent nets based on new modified reachability trees (NMRTs). ωRT can effectively decrease the number of nodes by removing duplicate and ω-duplicate nodes in the tree, and verify properties such as reachability, liveness and deadlocks. Two examples are provided to show its superiority over NMRTs in terms of tree size.      

The implementation of a smartphone-based fall detection system using a high-level fuzzy Petri net

The falling down problem has become one of the very important issues of global public health in an aging society. The specific equipment was adopted as the detection device of falling-down in the early studies, but it is inconvenient for the elderly and difficult for future application. The smart phone more commonly used than the specific fall detection equipment is selected as a mobile device for human fall detection, and a fall detection algorithm is developed for this purpose. What the user has to do is to put the smart phone in his/her thigh pocket for falling down detection. The signals detected by the tri-axial G-sensor are converted into signal vector magnitudes as the basis of detecting a human body in a stalling condition. The Z-axis data sets are captured for identification of human body inclination and the occurrence frequencies at the peak of the area of use are used as the input parameters. A high-level fuzzy Petri net is used for the analysis and the development of identifying human actions, including normal action, exercising, and falling down. The results of this study can be used in the relevant equipments or in the field of home nursing.     

Petri网在计算机网络实时性分析中的应用

计算机网络实时性分析问题一直是国内外各知名院校、研究机构的研究重点之一。Petri网是一种可以描述系统动态行为特性的图形化建模工具,直观形象,易于学习和理解,便于使用。为此,在给出Petri网基本介绍的基础上,探讨了Petri网在计算机网络实时性分析中的应用价值。     

网络管理中事件关联检测机制的研究

网络事件的关联检测是网络管理需要解决的一个关键问题,本文根据分布式网络管理的特点,首次明确定义了网络事件的基本关联关系,在此基础上提出了一种基于Petri Net的事件关联检测机制,实现了基于事件内容的细粒度关联检测,并且在事件检测中充分考虑了时间因素,有效地提高了事件关联检测的准确性。     

理想收敛理论的非标准刻画

为了用非标准分析方法进一步研究拓扑空间，在扩大模型下，对理想收敛的基本理论进行了非标准刻画：设X是拓扑空间，I是X中的理想，I收敛于点x，当且仅当v(x)包含v(I)．给出了理想的极限点和聚点的非标准特征，利用极限点对闭包进行了非标准描述，并讨论了理想收敛与伴随网收敛的相互关系．     

Analysis of the Datagram Congestion Control Protocol’s connection management procedures using the sweep-line method

State space explosion is a key problem in the analysis of finite state systems. The sweep-line method is a state exploration method which uses a notion of progress to allow states to be deleted from memory when they are no longer required. This reduces the peak number of states that need to be stored, while still exploring the full state space. The technique shows promise but has never achieved reductions greater than about a factor of 10 in the number of states stored in memory for industrially relevant examples. This paper discusses sweep-line analysis of the connection management procedures of a new Internet standard, the Datagram Congestion Control Protocol (DCCP). As the intuitive approaches to sweep-line analysis are not effective, we introduce new variables to track progress. This creates further state explosion. However, when used with the sweep-line, the peak number of states is reduced by over two orders of magnitude compared with the original. Importantly, this allows DCCP to be analysed for larger parameter values. Somsak Vanit-Anunchai was partially supported by an Australian Research Council Discovery Grant (DP0559927) and Suranaree University of Technology. Guy Edward Gallasch was supported by an Australian Research Council Discovery Grant (DP0559927).