scispace - formally typeset
Search or ask a question
Topic

Process architecture

About: Process architecture is a research topic. Over the lifetime, 4876 publications have been published within this topic receiving 104171 citations.


Papers
More filters
Proceedings ArticleDOI
16 May 1998
TL;DR: An efficient search algorithm for finding optimal deadlock-free schedules in FMS modeled by S/sup 4/R nets is presented, based on the branch and bound principle, the depth first search and truncation techniquesbased on the structure theory of Petri nets.
Abstract: An efficient search algorithm for finding optimal deadlock-free schedules in FMS modeled by S/sup 4/R nets is presented. The algorithm is based on the branch and bound principle, the depth first search and truncation techniques based on the structure theory of Petri nets. It is applied to the timed S/sup 4/R net extended with priority rules. The efficiency of the proposed approach is illustrated using an example from the literature.

25 citations

Journal ArticleDOI
TL;DR: A framework for quantifying the risk induced by the potential for cyber attacks levied against network-supported operations and a formal assessment of candidate risk management policies that address network host vulnerabilities and host-process coupling are presented.

24 citations

Proceedings ArticleDOI
11 Dec 1989
TL;DR: An examination is made of the problem of eliminating vanishing states during the solution of a generalized stochastic Petri net, and the asymptotic complexity of a matrix-based algorithm is shown to grow quadratically with the number of tangible states.
Abstract: A generalized stochastic Petri net can be analyzed by studying the reachability graph of feasible markings. An examination is made of the problem of eliminating vanishing states during the solution of a generalized stochastic Petri net. The asymptotic complexity of a matrix-based algorithm is shown to grow quadratically with the number of tangible states. A simpler graph-based algorithm that executes much more rapidly on typical models is examined. Some alternatives to elimination are discussed. >

24 citations

Proceedings ArticleDOI
22 Oct 1995
TL;DR: A new technique is proposed for the modeling of production ratios and establish tight lower bounds for the WIP, giving thereby a measure for the performance increase obtained.
Abstract: In this paper we present a systematic approach of modelling ratio-driven flexible manufacturing systems with Petri nets. We focus on the impact of universal or dedicated transport resources and the way the operation sequences are modeled as closed loops. For a particular problem setting, minimizing the necessary work in process (WIP) while saturating the critical machines, we show that the modeling approach based on timed event graphs, in the way it is commonly used, may induce unnecessary constraints on the WIP. In order to overcome this problem we propose a new technique for the modeling of production ratios and establish tight lower bounds for the WIP, giving thereby a measure for the performance increase obtained.

24 citations

Proceedings ArticleDOI
10 Aug 1995
TL;DR: An interactive project management approach based on the Petri net to overcome the limitations of network diagrams is introduced and is applicable to the control of more general discrete event dynamic systems as well as the project management problem.
Abstract: The demand for effective project management increases as the complexity and cost of a project grown. This paper introduces an interactive project management approach based on the Petri net to overcome the limitations of network diagrams. In the Petri net based approach, the project manager does fine tuning of the planning and scheduling with the resource constraints embedded in the plan representation. The Petri net controller maintains three plan representations. The reference, monitor and predictor Petri nets. These three nets are configured with the resource database to form a feedback loop such that the controller can monitor and control the project online. This structure is applicable to the control of more general discrete event dynamic systems as well as the project management problem. In case no admissible control action can be found, the manager turns to the rescheduling/replanning mode to generate a new plan and schedule.

24 citations


Network Information
Related Topics (5)
Software development
73.8K papers, 1.4M citations
82% related
Scheduling (computing)
78.6K papers, 1.3M citations
82% related
Control theory
299.6K papers, 3.1M citations
82% related
Control system
129K papers, 1.5M citations
81% related
Server
79.5K papers, 1.4M citations
81% related
Performance
Metrics
No. of papers in the topic in previous years
YearPapers
202318
202249
20216
20207
201916
201821