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.     

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.      

Development of a safety critical software requirements verification method with combined CPN and PVS: a nuclear power plant protection system application

Safety-critical software systems such as certain nuclear instrumentation and control (NI&C) systems should be developed with thorough verification. This study presents a method of software requirement verification with a case study for a nuclear power plant (NPP) protection system. The verification introduces colored petri net (CPN) for system modeling and prototype verification system (PVS) for mathematical verification. In order to aid flow-through from modeling by CPN to mathematical proof by PVS, an information extractor from CPN models has been developed in this paper. In order to convert the extracted information to the PVS specification language, a translator has also been developed. This combined method has been applied to the functional requirements of the Wolsong NPP Shut Down System #2 (SDS2); logical properties of the requirements were verified. Through this research, guidelines and a tool support for the use of formal methods have been developed for application to NI&C software verification.     

Efficient simulation of hierarchical stochastic activity network models

Stochastic extensions to Petri nets have gained widespread acceptance as a method for describing the dynamic behavior of discrete-event systems. Both simulation and analytic methods have been proposed to solve such models. This paper describes a set of efficient procedures for simulating models that are represented as stochastic activity networks (SANs, a variant of stochastic Petri nets) and composed SAN-based reward models (SBRMs). Composed SBRMs are a hierarchical representation for SANs, in which individual SAN models can be replicated and joined together with other models, in an iterative fashion. The procedures exploit the hierarchical structure and symmetries introduced by the replicate operation in a composed SBRM to reduce the cost of future event list management. The procedures have been implemented as part of a larger performance-dependability modeling package known asUltraSAN, and have been applied to real, large-scale applications. This work was supported in part by the Digital Equipment Corporation Faculty Program: Incentives for Excellence.     

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

为了用非标准分析方法进一步研究拓扑空间，在扩大模型下，对理想收敛的基本理论进行了非标准刻画：设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).     

Synchronization models for multimedia presentation with user participation

This paper addresses the key issue of providingflexible multimedia presentation with user participation and suggests synchronization models that can specify the user participation during the presentation. We study models like the Petrinet-based hypertext model and the object composition Petri nets (OCPN). We suggest adynamic timed Petri nets structure that can model pre-emptions and modifications to the temporal characteristics of the net. This structure can be adopted by the OCPN to facilitate modeling of multimedia synchronization characteristics with dynamic user participation. We show that the suggested enhancements for the dynamic timed Petri nets satisfy all the properties of the Petri net theory. We use the suggested enhancements to model typical scenarios in a multimedia presentation with user inputs.     

模糊Petri网及知识表示

在建造专家系统中虽然有很多种知识表示方法，但都有不尽人意的地方，本文试图用一种新的方法－Ｐｅｔｒｉ网模型来表示知识。本文给出了Ｆｕｚｚｚｙ Ｐｅｔｒｉ网和广义Ｆｕｚｚｙ Ｐｅｔｒｉ网两种模型，并给出了相应的推理算法，一旦专家知识用Ｐｅｔｒｉ网表示后，根据Ｐｅｔｒｉ网固有的特性，我们就能处理专家系统中并行推理、无回溯推理，反向推理等问题。