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: The aim of this paper is an introduction to the area ofPetri net transformations, a rule-based approach for dynamic changes of the net structure of Petri nets, especially important for the stepwise construction of petri nets in the software development process in software engineering.
33 citations
01 Jan 2014
TL;DR: A universal Petri net with 14 places, 42 transitions, and 218 arcs was built in the class of deterministic inhibitor Petri nets (DIPNs); it is based on the minimal Turing machine (TM) of Woods and Neary with 6 states, 4 symbols, and 23 instructions, directly simulated by a PetriNet.
Abstract: A universal Petri net with 14 places, 42 transitions, and 218 arcs was built in the class of deterministic inhibitor Petri nets (DIPNs); it is based on the minimal Turing machine (TM) of Woods and Neary with 6 states, 4 symbols, and 23 instructions, directly simulated by a Petri net. Several techniques were developed, including bi-tag system (BTS) construction on a DIPN, special encoding of TM tape by two stacks, and concise subnets that implement arithmetic encoding operations. The simulation using the BTS has cubic time and linear space complexity, while the resulting universal net runs in exponential time and quadratic space with respect to the target net transitions' firing sequence length. The technique is applicable for simulating any TM by the Petri net.
33 citations
02 Jul 2003
TL;DR: The expressive capabilities of the model and the type of results that can be derived through symbolic enumeration of its dense-timed state space are illustrated with reference to a flexible system mixing dynamic acceptance and performance polymorphism.
Abstract: Preemptive Time Petri nets are obtained by extending Time Petri nets with an additional mechanism of resource assignment which makes the progress of timed transitions be dependent on the availability of a set of preemptable resources, and with the capability to make transition times and priorities be dependent on the marking. The combination of these capabilities supports description and verification of flexible real time systems running under preemptive scheduling, with periodic, sporadic and one shot processes, with non-deterministic execution times, with semaphore synchronizations and precedence relations deriving from internal task sequentialization and from interprocess communication. The expressive capabilities of the model and the type of results that can be derived through symbolic enumeration of its dense-timed state space are illustrated with reference to a flexible system mixing dynamic acceptance and performance polymorphism.
33 citations
01 Sep 2003
TL;DR: Software engineering and Petri net theory are disciplines of different nature that investigate applications and properties of a specific model (Petri nets) and try to find a coherent set of solutions to cope with the different aspects of the problem.
Abstract: Software engineering and Petri net theory are disciplines of different nature. Research on software engineering focuses on a problem domain, i.e., the development of complex software systems, and tries to find a coherent set of solutions to cope with the different aspects of the problem, while research on Petri nets investigates applications and properties of a specific model (Petri nets).
33 citations
TL;DR: A new method is proposed to evaluate the performance of concurrent systems using a set of ordinary differential equations of a restricted type to avoid a state explosion problem encountered by the conventional methods based on Continuous-Time Markov Chains.
Abstract: In this paper, a new method is proposed to evaluate the performance of concurrent systems. A concurrent system consisting of multiple processes that communicate via message passing mechanisms is modeled by a Petri net, which is in turn represented by a set of ordinary differential equations (ODEs) of a restricted type. The equations describe the system state changes, and the solutions, also called state measures, can be used for the performance analysis such as estimating response time, throughput and efficiency. This method can avoid a state explosion problem encountered by the conventional methods based on Continuous-Time Markov Chains. Its application to an IBM business system is given as an example.
33 citations