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
Journal ArticleDOI
TL;DR: In this article, the authors present an architecture for shop floor controllers based on colored Petri nets with ordered colored sets and structured input and output functions, which can automatically respond to changes (e.g., in part type or part routing) in the system.
Abstract: In a dynamic and flexible manufacturing environment, a shop-floor controller must be designed so that it automatically (or with minimum human intervention) and quickly responds to the changes (e.g., in part type or part routing) in the system. Such a performance may be achieved provided that the controller is simple and sufficiently general in its scope of application. In this article, we present an architecture for such a shop-floor controller. The architecture is based on colored Petri nets with ordered colored sets and structured input and output functions.

34 citations

Journal ArticleDOI
TL;DR: In this article, the authors use timed Petri nets to model the delay in performing certain operations of a communication protocol and use them to describe and algebraically specify communication system performance.
Abstract: There has been a lot of interest in the past decade in using timed Petri nets to model computer systems. In this paper we show how such timed Petri nets can be used to great advantage in describing and algebraically specifying communication system performance. We make use of the time parameter of timed Petri nets to model the delay in performing certain operations of a communication protocol. The specification is borrowed from the recently reported AFFIRM language, and the protocol chosen for illustration is the ECMA transfer protocol, proposed for the ISO reference model. However, the methodology can be used with other protocols as well. We also show how liveness properties can be specified, easily using timed Petri nets.

34 citations

Proceedings ArticleDOI
05 Dec 2004
TL;DR: The method is fast because it is difference bounds matrix (DBM)-based, and that it has online stopwatch reduction mechanisms, and has a fairly lower number of stopwatches than what could be obtained by a direct modelling of the system as SWA.
Abstract: In this paper, we present a method for the timed analysis of real-time systems, taking into account the scheduling constraints. The model considered is an extension of time Petri nets, scheduling extended time Petri nets (SETPN) for which the valuations of transitions may be stopped and resumed, thus allowing the modelling of preemption. This model has a great expressivity and allows a very natural modelling. The method we propose consists of precomputing, with a fast algorithm, the state space of the SETPN as a stopwatch automaton (SWA). This stopwatch automaton is proven timed bisimilar to the SETPN, so we can perform the timed analysis of the SETPN through it with the tool on linear hybrid automata, HYTECH. The main interests of this precomputation are that it is fast because it is difference bounds matrix (DBM)-based, and that it has online stopwatch reduction mechanisms. Consequently, the resulting stopwatch automaton has, in the general case, a fairly lower number of stopwatches than what could be obtained by a direct modelling of the system as SWA. Since the number of stopwatches is critical for the complexity of the verification, the method increases the efficiency of the timed analysis of the system, and in some cases may just make it possible at all.

34 citations

Journal ArticleDOI
TL;DR: Trace nets are a variant of one-safe Petri nets, where input and output places may be filled as well as emptied by transitions, based on permutation of proved transitions.
Abstract: Trace nets are a variant of one-safe Petri nets, where input and output places may be filled as well as emptied by transitions. Those extended nets are introduced for modelling concurrency in a simple format of structural operational specifications, based on permutation of proved transitions. Trace nets are connected by an adjunction to a particular class of trace automata in the sense of Stark, namely the separated trace automata. The adjunction is based on a calculus of `regions' that differ significantly from the ones devised by Ehrenfeucht and Rozenberg for elementary nets, although the axioms of separation are the same.

34 citations

Book ChapterDOI
23 Aug 2005
TL;DR: The expressive power of the four computational interpretations of Petri nets is measured in terms of the classes of labelled step transition systems up to isomorphism of reachable parts that can be denoted by nets under each of the interpretations.
Abstract: Starting from the opinion that the standard firing rule of Petri nets embodies the collective token interpretation of nets rather than their individual token interpretation, I propose a new firing rule that embodies the latter. Also variants of both firing rules for the self-sequential interpretation of nets are studied. Using these rules, I express the four computational interpretations of Petri nets by semantic mappings from nets to labelled step transition systems, the latter being event-oriented representations of higher dimensional automata. This paper totally orders the expressive power of the four interpretations, measured in terms of the classes of labelled step transition systems up to isomorphism of reachable parts that can be denoted by nets under each of the interpretations. Furthermore, I extend the unfolding construction of place/transition nets into occurrence net to nets that may have transitions without incoming arcs.

34 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