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 paper discusses the expressiveness of the extended model with the authentication primitives, and proves that both models are strictly in between P/T nets and Turing machines.
31 citations
TL;DR: This article presents an original method using high level Petri nets for the specification and design of interactive systems and suggests an agent oriented architecture based on the classic components of an interactive application.
31 citations
TL;DR: This review aims to give a short informal introduction to the basic formalism of Petri nets, and to discuss possible applications to the analysis of chemical reaction networks, including cheminformatics.
Abstract: In this review we introduce and discuss Petri nets - a mathematical formalism to describe and analyze chemical reaction networks. Petri nets were developed to describe concurrency in general systems. We find most applications to technical and financial systems, but since about twenty years also in systems biology to model biochemical systems. This review aims to give a short informal introduction to the basic formalism illustrated by a chemical example, and to discuss possible applications to the analysis of chemical reaction networks, including cheminformatics. We give a short overview about qualitative as well as quantitative modeling Petri net techniques useful in systems biology, summarizing the state-of-the-art in that field and providing the main literature references. Finally, we discuss advantages and limitations of Petri nets and give an outlook to further development.
31 citations
TL;DR: The special structure in these transition systems of Petri nets is exploited to provide an exact and closed-form characterization of all its inductive linear invariants and an invariant generation technique that is shown to be efficient and powerful in practice.
Abstract: Petri nets have been widely used to model and analyze concurrent systems. Their wide-spread use in this domain is, on one hand, facilitated by their simplicity and expressiveness. On the other hand, the analysis of Petri nets for questions like reachability, boundedness and deadlock freedom can be surprisingly hard. In this paper, we model Petri nets as transition systems. We exploit the special structure in these transition systems to provide an exact and closed-form characterization of all its inductive linear invariants. We then exploit this characterization to provide an invariant generation technique that we demonstrate to be efficient and powerful in practice. We compare our work with those in the literature and discuss extensions.
31 citations