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 published on a yearly basis
Papers
More filters
[...]
TL;DR: This work adds mobility to Place-Transition Petri nets: tokens are names for places, and an input token of a transition can be used in its postset to specify a destination, and defines a simple hierarchy of nets with increasing degrees of dynamicity.
Abstract: We add mobility to Place-Transition Petri nets: tokens are names for places, and an input token of a transition can be used in its postset to specify a destination. Mobile Petri nets are then further extended to dynamic nets by adding the possibility of creating new nets during the firing of a transition. In this way, starting from Petri nets, we define a simple hierarchy of nets with increasing degrees of dynamicity. For each class in this hierarchy, we provide its encoding in the former class.
Our work was largely inspired by the join-calculus of Fournet and Gonthier, which turns out to be a (well-motivated) particular case of dynamic Petri nets. The main difference is that, in the preset of a transition, we allow both non-linear patterns (name unification) and (locally) free names for input places (that is, we remove the locality constraint, and preserve reflexion).
90 citations
29 Aug 1988
TL;DR: This work shows how the intuitive causal dependencies in a CCS program are represented via the net semantics via the usual interleaving semantics.
Abstract: A non-interleaving semantics for a subset of CCS using finite place/transition-systems is presented. Straightforward constructions on nets for CCS operations are given. When restricting the language appropriately (no restriction and relabelling, only guarded choice), these operations yield a net semantics with a clear distinction of concurrency and nondeterminism. It is shown that the usual interleaving semantics is retrievable from the net semantics. Partial order semantics and equivalence notions for labelled P/T-systems are discussed. This shows how the intuitive causal dependencies in a CCS program are represented via the net semantics.
90 citations
TL;DR: This paper proposes a new concept called characteristic implicit resource-transition nets, and successfully establishes a necessary and sufficient condition for a resource subset to generate an SMS.
Abstract: Systems of sequential systems with shared resources (S4PR) represent a class of Petri nets that have powerful modeling capability for resource allocation systems. Their efficient siphon computation is important. An open issue is how to determine whether a resource subset can generate a strict minimal siphon (SMS). This paper presents the answer. In particular, we propose a new concept called characteristic implicit resource-transition nets. By charactering such nets, we successfully establish a necessary and sufficient condition for a resource subset to generate an SMS.
89 citations
TL;DR: It is shown that the trimming of an unbounded Petri net is not always possible and a new class of PetriNet languages, that may be generated by nonblocking nets, is defined.
Abstract: This note discusses the use of Petri net languages in supervisory control theory. First it is shown that the trimming of an unbounded Petri net is not always possible and a new class of Petri net languages, that may be generated by nonblocking nets, is defined. Secondly, necessary and sufficient conditions for the existence of a Petri net supervisor, under the hypothesis that the system's behavior and the legal behavior are both Petri net languages, are derived. Finally, by means of an example, it is shown that Petri net languages are not closed under the supremal controllable sublanguage operator. >
88 citations
TL;DR: In this article, the authors present a systematic methodology for modeling and analysis of manufacturing supply chain business processes, which employs Computer Integrated Manufacturing Open System Architecture (CIMOSA) behavior rules to model the business process routing structures.
Abstract: This paper presents a systematic methodology for modeling and analysis of manufacturing supply chain business processes. The proposed approach first employs Computer Integrated Manufacturing Open System Architecture (CIMOSA) behavior rules to model the business process routing structures of manufacturing supply chain networks. Object-oriented predicate/transition nets (OPTNs) are then developed for the modular modeling and analysis of process models. Based on the structure of OPTNs, a procedure to obtain the system's P -invariants through objects’ P -invariants is suggested. From the P -invariants obtained, system structural properties such as deadlock and overflow can be analyzed. By using Petri net unfolding techniques and by extracting the process model of each object from the entire process model, the sequencing analysis for operations in supply chain processes becomes possible. Several manufacturing supply chain examples are used to illustrate the effectiveness of the proposed method.
88 citations