A Petri-Net Approach for Modeling Product Configuration Problems under Mass Customization

2011 ◽  
Vol 215 ◽  
pp. 107-110
Author(s):  
Dong Yang
Keyword(s):  
Petri Net ◽  
Mass Customization ◽  
Discrete Systems ◽  
Product Configuration ◽  
Enabling Technology ◽  
Initial State ◽  
Final State ◽  
Structural Relationships ◽  
Configuration Problem

Product configuration is a key enabling technology for implementing mass customization production. In this paper, we present an approach for modeling product configuration problems using Petri Net, a well-defined formalism for describing complex discrete systems. In the presented approach, components within a configurable product are modeled as places of PN whereas structural relationships between components are represented as transitions of PN. Configuration rules such as inclusion and exclusion rules are also described through the elements of PN. By modeling product configuration as a PN, a configuration solution is a set of transitions leading from the initial state of PN to a final state of PN. Therefore, the configuration problem can be solved by analyzing corresponding PN representation.

Modeling and Solving Product Configuration Problems Using Petri Net

2011 ◽  
Vol 201-203 ◽  
pp. 1379-1383
Author(s):  
Dong Yang
Keyword(s):  
Petri Net ◽  
Mass Customization ◽  
Discrete Systems ◽  
Product Configuration ◽  
Enabling Technology ◽  
Initial State ◽  
Final State ◽  
Structural Relationships ◽  
Configuration Problem

This Product configuration is a key enabling technology for implementing mass customization production. In this paper, we present an approach for modeling product configuration problems using Petri Net, a well-defined formalism for describing complex discrete systems. In the presented approach, components within a configurable product are modeled as places of PN whereas structural relationships between components are represented as transitions of PN. Configuration rules such as inclusion and exclusion rules are also described through the elements of PN. By modeling product configuration as a PN, a configuration solution is a set of transitions leading from the initial state of PN to a final state of PN. Therefore, the configuration problem can be solved by analyzing corresponding PN representation.

scholarly journals Finding Cut-Offs in Leaderless Rendez-Vous Protocols is Easy

2021 ◽  
pp. 42-61
Author(s):  
A. R. Balasubramanian ◽  
Javier Esparza ◽  
Mikhail Raskin
Keyword(s):  
Lower Bounds ◽  
Petri Net ◽  
Special Class ◽  
Upper Bounds ◽  
Initial State ◽  
Reachability Problem ◽  
Final State ◽  
Final Configuration ◽  
Finite State ◽  
State Agents

AbstractIn rendez-vous protocols an arbitrarily large number of indistinguishable finite-state agents interact in pairs. The cut-off problem asks if there exists a number B such that all initial configurations of the protocol with at least B agents in a given initial state can reach a final configuration with all agents in a given final state. In a recent paper [17], Horn and Sangnier prove that the cut-off problem is equivalent to the Petri net reachability problem for protocols with a leader, and in "Image missing" for leaderless protocols. Further, for the special class of symmetric protocols they reduce these bounds to "Image missing" and "Image missing" , respectively. The problem of lowering these upper bounds or finding matching lower bounds is left open. We show that the cut-off problem is "Image missing" -complete for leaderless protocols, "Image missing" -complete for symmetric protocols with a leader, and in "Image missing" for leaderless symmetric protocols, thereby solving all the problems left open in [17].

scholarly journals Management of Product Configuration Conflicts to Increase the Sustainability of Mass Customization

2020 ◽  
Vol 12 (9) ◽  
pp. 3610 ◽  
Author(s):  
Vladimir Modrak ◽  
Zuzana Soltysova
Keyword(s):  
Mass Customization ◽  
Product Variety ◽  
Rapid Decrease ◽  
Product Configuration ◽  
Trade Off ◽  
Manufacturing Complexity ◽  
Corrective Actions ◽  
Configuration Problem

An important role in product variety management is finding an accurate variety extent to which the product matches the consumer’s expectations. In principle, customers prefer to have more rather than less versions of a product from which to choose. This motivates producers to offer a richer variety of goods. As a consequence, it brings a large amount of manufacturing complexity, and configuration conflicts may frequently occur. In order to avoid a situation in which a customer will select mutually incompatible components, product configurators usually recommend corrective actions for generating valid configurations. Nevertheless, the presence of infeasible configurations in customer options are negatively perceived by customers, and therefore it has an unfavorable impact on the sustainability of mass customization. One way to solve this problem is to eliminate, or at least reduce, mutually incompatible components. When considering the fact that eliminating all incompatible components may cause a rapid decrease in product variety, then the reduction of incompatible components can help to solve the product configuration problem. The proposed method aims to find a trade-off solution between minimizing configuration conflicts and maintaining a sufficient level of mass customization. Moreover, two supplementary methods for the determination of infeasible product configurations are proposed in this paper. The applicability and effectiveness of the proposed methods are demonstrated by two practical examples.

scholarly journals Dual subtractions

2021 ◽  
Vol 2021 (6) ◽  
Author(s):  
Renato Maria Prisco ◽  
Francesco Tramontano
Keyword(s):  
Field Theory ◽  
Quantum Field ◽  
Matrix Elements ◽  
Leading Order ◽  
Initial State ◽  
Final State ◽  
Dual Representation ◽  
Subtraction Scheme ◽  
Theoretical Predictions ◽  
Perturbative Quantum

Abstract We propose a novel local subtraction scheme for the computation of Next-to-Leading Order contributions to theoretical predictions for scattering processes in perturbative Quantum Field Theory. With respect to well known schemes proposed since many years that build upon the analysis of the real radiation matrix elements, our construction starts from the loop diagrams and exploits their dual representation. Our scheme implements exact phase space factorization, handles final state as well as initial state singularities and is suitable for both massless and massive particles.

Some Possibilities of Modeling Colored Petri Nets

2021 ◽  
pp. 77-91
Author(s):  
Goharik Petrosyan ◽  
Armen Gaboutchian ◽  
Vladimir Knyaz
Keyword(s):  
Petri Nets ◽  
Petri Net ◽  
Optimal Allocation ◽  
Production Systems ◽  
Oriented Graph ◽  
Discrete Systems ◽  
Colored Petri Nets ◽  
Venn Diagram ◽  
Colored Petri Net ◽  
Language Class

Petri nets are a mathematical apparatus for modelling dynamic discrete systems. Their feature is the ability to display parallelism, asynchrony and hierarchy. First was described by Karl Petri in 1962 [1,2,8]. The Petri net is a bipartite oriented graph consisting of two types of vertices - positions and transitions connected by arcs between each other; vertices of the same type cannot be directly connected. Positions can be placed by tags (markers) that can move around the network. [2] Petri Nets (PN) used for modelling real systems is sometimes referred to as Condition/Events nets. Places identify the conditions of the parts of the system (working, idling, queuing, and failing), and transitions describe the passage from one state to another (end of a task, failure, repair...). An event occurs (a transition fire) when all the conditions are satisfied (input places are marked) and give concession to the event. The occurrence of the event entirely or partially modifies the status of the conditions (marking). The number of tokens in a place can be used to identify the number of resources lying in the condition denoted by that place [1,2,8]. Coloured Petri nets (CPN) is a graphical oriented language for design, specification, simulation and verification of systems [3-6,9,15]. It is in particular well-suited for systems that consist of several processes which communicate and synchronize. Typical examples of application areas are communication protocols, distributed systems, automated production systems, workflow analysis and VLSI chips. In the Classical Petri Net, tokens do not differ; we can say that they are colourless. Unlike standard Petri nets in Colored Petri Net of a position can contain tokens of arbitrary complexity, such as lists, etc., that enables modelling to be more reliable. The article is devoted to the study of the possibilities of modelling Colored Petri nets. The article discusses the interrelation of languages of the Colored Petri nets and traditional formal languages. The Venn diagram, which the author has modified, shows the relationship between the languages of the Colored Petri nets and some traditional languages. The language class of the Colored Petri nets includes a whole class of Context-free languages and some other classes. The paper shows modelling the task synchronization Patil using Colored Petri net, which can't be modeled using well- known operations P and V or by classical Petri network, since the operations P and V and classical Petri networks have limited mathematical properties which do not allow to model the mechanisms in which the process should be synchronized with the optimal allocation of resources.

scholarly journals Development and testing of a community flood resilience measurement tool

2016 ◽  
Author(s):  
Adriana Keating ◽  
Karen Campbell ◽  
Michael Szoenyi ◽  
Colin McQuistan ◽  
David Nash ◽  
...  
Keyword(s):  
Sustainable Livelihoods ◽  
Development Work ◽  
Measurement Tool ◽  
Disaster Resilience ◽  
Initial State ◽  
Final State ◽  
Sustainable Livelihoods Framework ◽  
Flood Characteristics ◽  
Over Time ◽  
Livelihoods Framework

Abstract. Given the increased attention on resilience-strengthening in international humanitarian and development work, there is a growing need to invest in its measurement and the overall accountability of "resilience strengthening" initiatives. We present a framework and tool for measuring community level resilience to flooding, built around the five capitals (5Cs) of the Sustainable Livelihoods Framework. At the time of writing the tool is being tested in 75 communities across 10 countries. Currently 88 potential sources of resilience are measured at the baseline (initial state) and endline (final state) approximately two years later. If a flood occurs in the community during the study period, resilience outcome measures are recorded. By comparing pre-flood characteristics to post flood outcomes, we aim to empirically verify sources of resilience, something which has never been done in this field. There is an urgent need for the continued development of theoretically anchored, empirically verified and practically applicable disaster resilience measurement frameworks and tools so that the field may: a) deepen understanding of the key components of "disaster resilience" in order to better target resilience enhancing initiatives, and b) enhance our ability to benchmark and measure disaster resilience over time, and compare how resilience changes as a result of different capacities, actions and hazards.

UML-BASED MODELING AND ANALYSIS OF SECURITY THREATS

2010 ◽  
Vol 20 (06) ◽  
pp. 875-897 ◽  
Author(s):  
JUN KONG ◽  
DIANXIANG XU ◽  
XIAOQIN ZENG
Keyword(s):  
Formal Method ◽  
Graph Transformation ◽  
State Transitions ◽  
Security Threats ◽  
Sequence Diagrams ◽  
Security Threat ◽  
Initial State ◽  
Final State ◽  
Modeling And Analysis ◽  
Software Application

Poor design has been a major source of software security problems. Rigorous and designer-friendly methodologies for modeling and analyzing secure software are highly desirable. A formal method for software development, however, often suffers from a gap between the rigidity of the method and the informal nature of system requirements. To narrow this gap, this paper presents a UML-based framework for modeling and analyzing security threats (i.e. potential security attacks) rigorously and visually. We model the intended functions of a software application with UML statechart diagrams and the security threats with sequence diagrams, respectively. Statechart diagrams are automatically converted into a graph transformation system, which has a well-established theoretical foundation. Method invocations in a sequence diagram of a security threat are interpreted as a sequence of paired graph transformations. Therefore, the analysis of a security threat is conducted through simulating the state transitions from an initial state to a final state triggered by method invocations. In our approach, designers directly work with UML diagrams to visually model system behaviors and security threats while threats can still be rigorously analyzed based on graph transformation.

scholarly journals Study of the influence of initial-state fluctuations on hydrodynamic simulations

2020 ◽  
Vol 245 ◽  
pp. 06005
Author(s):  
Marcin Słodkowski ◽  
Patryk Gawryszewski ◽  
Dominik Setniewski
Keyword(s):  
Initial Conditions ◽  
Graphics Processing Unit ◽  
Heavy Ion ◽  
Processing Unit ◽  
Initial State ◽  
Final State ◽  
Hydrodynamic Simulation ◽  
Hydrodynamic Simulations ◽  
Cartesian Coordinate ◽  
Ion Collision

In this work, we are focusing on assessing the contribution of the initial-state fluctuations of heavy ion collision in the hydrodynamic simulations. We are trying to answer the question of whether the hydrodynamic simulation retains the same level of fluctuation in the final-state as for the initial stage. In another scenario, the hydrodynamic simulations of the fluctuation drowns in the final distribution of expanding matter. For this purpose, we prepared sufficient relativistic hydrodynamic program to study A+A interaction which allows analysing initial-state fluctuations in the bulk nuclear matter. For such an assumption, it is better to use high spatial resolution. Therefore, we applied the (3+1) dimensional Cartesian coordinate system. We implemented our program using parallel computing on graphics cards processors - Graphics Processing Unit (GPU). Simulations were carried out with various levels of fluctuation in initial conditions using the average method of events coming from UrQMD models. Energy density distributions were analysed and the contribution of fluctuations in initial conditions was assessed in the hydrodynamic simulation.

Mass Customization Management in E-Commerce Configuration with early Supplier Involvement

2011 ◽  
Vol 189-193 ◽  
pp. 47-52
Author(s):  
Yan Ting Ni ◽  
Jing Min Li ◽  
Yi Wang ◽  
Jin Yao
Keyword(s):  
Supply Chain ◽  
Information Integration ◽  
Mass Customization ◽  
Product Information ◽  
Value Systems ◽  
Product Configuration ◽  
Customer Requirements ◽  
Generic Structure ◽  
Supplier Involvement ◽  
Configuration Generation

In terms of transforming supply chain into integrated value systems, the benefits of Early Supplier Involvement (ESI) in product development have been widely accepted. As far as variety management and online configuration are concerned, the difficulties of ESI in online mass customization manifest themselves through two main aspects: (1) Support the seamless information integration with respect to its high variety and large volume not only among internal functions but also with external suppliers; (2) Support real-time online configuration for product configuration generation and optimization based on customer requirements and supplier capabilities. Accordingly, this work proposes two potential solutions. PFA-based integrated information model is established to synchronize the PFA generic structure and supplier product information.

Sign in / Sign up

Export Citation Format

Share Document