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
Book ChapterDOI
02 Apr 2001
TL;DR: It is proved that a join process is typeable according to Δi if and only if it is (strictly equivalent to) a net of class Πi, and a hierarchy of type systems of decreasing strictness is introduced.
Abstract: We study the expressiveness of the join calculus by comparison with (generalised, coloured) Petri nets and using tools from type theory More precisely, we consider four classes of nets of increasing expressiveness, Πi, introduce a hierarchy of type systems of decreasing strictness, Δi, i = 0, , 3, and we prove that a join process is typeable according to Δi if and only if it is (strictly equivalent to) a net of class Πi In the details, Π0 and Π1 contain, resp, usual place/transition and coloured Petri nets, while Π2 and Π3 propose two natural notions of high-level net accounting for dynamic reconfiguration and process creation and called reconfigurable and dynamic Petri nets, respectively

42 citations

Journal ArticleDOI
01 Oct 1997
TL;DR: A Petri net synthesis theory is enhanced with the capability to deal with reversibility, which is an important property related to the concept of error recovery in manufacturing, and the liveness-checking algorithm can be used to check reversal without modification.
Abstract: This paper enhances a Petri net synthesis theory with the capability to deal with reversibility, which is an important property related to the concept of error recovery in manufacturing. The theory has been proposed to synthesize a class of Petri nets for modeling shared-resource automated manufacturing systems. The class of nets has been shown to be conservative (bounded) and possess structural liveness under two sufficient conditions. The conditions can be checked structurally by an algorithm without enumerating the states. A bounded and live net means that the modeled system cannot have capacity overflows and deadlocks, two types of unwanted behaviors in manufacturing. In this paper it is further proven that under these two sufficient conditions, the class of nets possesses reversibility. Thus the liveness-checking algorithm can be used to check reversibility without modification.

42 citations

Journal ArticleDOI
TL;DR: The paper contributes significantly in the area of computer-based decision making and provides value to practicing schedulers, estimators, and project managers who deal with complex construction processes.
Abstract: Computer modeling and analysis of construction processes have gained importance in recent years because of an increase in the complexity of construction processes. Petri nets provide a modeling and analysis approach that can be used to effectively study, understand, analyze, and improve construction processes. This paper highlights the advanced features of petri nets and describes their utilization as a process modeling and analysis tool for the study of a ready-mix concrete plant. Usually process modeling and analysis are performed by initially developing a graphical portrayal of the process and then dynamically studying the response of the process to external and internal factors. A petri net is a formal graphical modeling tool that can be efficiently utilized as a process modeling and analysis tool because it can graphically portray and dynamically analyze a process in an integrated manner. The paper contributes significantly in the area of computer-based decision making and provides value to practicing schedulers, estimators, and project managers who deal with complex construction processes.

42 citations

Book ChapterDOI
Jiří Srba1
20 Jun 2005
TL;DR: The isomorphism requirement is relaxed and efficient (polynomial time) reductions between networks of timed automata and 1-safe timed-arc Petri nets preserving the answer to the reachability question are provided.
Abstract: We establish mutual translations between the classes of 1-safe timed-arc Petri nets (and its extension with testing arcs) and networks of timed automata (and its subclass where every clock used in the guard has to be reset). The presented translations are very tight (up to isomorphism of labelled transition systems with time). This provides a convenient characterization from the theoretical point of view but is not always satisfactory from the practical point of view because of the possible non-polynomial blow up in the size (in the direction from automata to nets). Hence we relax the isomorphism requirement and provide efficient (polynomial time) reductions between networks of timed automata and 1-safe timed-arc Petri nets preserving the answer to the reachability question. This makes our techniques suitable for automatic translation into a format required by tools like UPPAAL and KRONOS. A direct corollary of the presented reductions is a new PSPACE-completeness result for reachability in 1-safe timed-arc Petri nets, reusing the region/zone techniques already developed for timed automata.

42 citations

Journal ArticleDOI
TL;DR: A tool called C2Petri has been developed which converts C-Pthreads programs to the equivalent Petri net model and helps verification of Pthread-based programs.
Abstract: Since most modern computing systems contain multiple processing elements, applications are relying on multithreaded programming techniques that allow a program to execute multiple tasks concurrently to take advantage of the processing capabilities. Multithreaded programs are more difficult to design and test because of the nondeterministic execution orders and synchronization among the threads. Different approaches can be used to test Multithreaded Applications. In our approach we use Petri nets to represent the key elements of interactions among threads to identify potential problems such as race conditions, lost signals, and deadlocks. A tool called C2Petri has been developed which converts C-Pthreads programs to the equivalent Petri net model. This tool helps verification of Pthread-based programs. At present the tool has limited capabilities and we hope to expand the capabilities of our tool in the near future.

42 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