scispace - formally typeset
Search or ask a question
Topic

Petri net

About: Petri net is a research topic. Over the lifetime, 25039 publications have been published within this topic receiving 406994 citations.


Papers
More filters
Journal ArticleDOI
TL;DR: A debugger which uses the design artifacts of the Prometheus agent-oriented software engineering methodology to alert the developer testing the system, that a specification has been violated and detailed information is provided regarding the error which can help the developer in locating its source.

85 citations

Journal ArticleDOI
Walter Vogler1
25 Aug 1997
TL;DR: A new partial order semantics of Petri nets with read arcs is studied, where read arcs model reading without consuming, which is often more adequate than the destructive-read-and-rewrite modelled in ordinary nets without read arcs.
Abstract: We study a new partial order semantics of Petri nets with read arcs, where read arcs model reading without consuming, which is often more adequate than the destructive-read-and-rewrite modelled in ordinary nets without read arcs. As basic observations we take ST-traces, which are sequences of transition starts and ends. We define processes of our nets and derive two partial orders modelling causality and start precedence. These partial orders are related to basic observations and their system states just as in the ordinary approach the single partial order of a process is related to firing sequences and reachable markings. Our approach also supports a new view of concurrency as captured by steps.

84 citations

Journal ArticleDOI
TL;DR: In this article, the authors describe and justify robust control flow conversion algorithms, which provide the basis for more advanced BPMN-based discovery and conformance checking algorithms, such as Petri nets, causal nets and process trees.
Abstract: Process-aware information systems (PAIS) are systems relying on processes, which involve human and software resources to achieve concrete goals. There is a need to develop approaches for modeling, analysis, improvement and monitoring processes within PAIS. These approaches include process mining techniques used to discover process models from event logs, find log and model deviations, and analyze performance characteristics of processes. The representational bias (a way to model processes) plays an important role in process mining. The BPMN 2.0 (Business Process Model and Notation) standard is widely used and allows to build conventional and understandable process models. In addition to the flat control flow perspective, subprocesses, data flows, resources can be integrated within one BPMN diagram. This makes BPMN very attractive for both process miners and business users, since the control flow perspective can be integrated with data and resource perspectives discovered from event logs. In this paper, we describe and justify robust control flow conversion algorithms, which provide the basis for more advanced BPMN-based discovery and conformance checking algorithms. Thus, on the basis of these conversion algorithms low-level models (such as Petri nets, causal nets and process trees) discovered from event logs using existing approaches can be represented in terms of BPMN. Moreover, we establish behavioral relations between Petri nets and BPMN models and use them to adopt existing conformance checking and performance analysis techniques in order to visualize conformance and performance information within a BPMN diagram. We believe that the results presented in this paper can be used for a wide variety of BPMN mining and conformance checking algorithms. We also provide metrics for the processes discovered before and after the conversion to BPMN structures. Cases for which conversion algorithms produce more compact or more complicated BPMN models in comparison with the initial models are identified.

84 citations

Book ChapterDOI
10 Apr 2000
TL;DR: This work has shown that structural termination (termination for every input) is undecidable for lossy counter machines, and this undecidability result has far reaching consequences.
Abstract: Lossy counter machines are defined as Minsky n-counter machines where the values in the counters can spontaneously decrease at any time. While termination is decidable for lossy counter machines, structural termination (termination for every input) is undecidable. This undecidability result has far reaching consequences. Lossy counter machines can be used as a general tool to prove the undecidability of many problems, for example (1) The verification of systems that model communication through unreliable channels (e.g. model checking lossy fifo-channel systems and lossy vector addition systems). (2) Several problems for reset Petri nets, like structural termination, boundedness and structural boundedness. (3) Parameterized problems like fairness of broadcast communication protocols.

84 citations

Journal ArticleDOI
01 Dec 2008
TL;DR: This article introduces a new states/events formalism, the so-called guarded transition system, which generalizes both block diagrams and Petri nets and makes it possible to handle looped systems, which no existing formalism is able to handle smoothly.
Abstract: States/events formalisms, such as Markov graphs or Petri nets, are widely used in reliability engineering studies. They have proved to be a very powerful tool both from conceptual and practical viewpoints. This article introduces a new states/events formalism, the so-called guarded transition system. The guarded transition system generalizes both block diagrams and Petri nets. It also makes it possible to handle looped systems, which no existing formalism is able to handle smoothly. Its use is illustrated by means of examples and several important issues such as composition and graphical representations are discussed. It is shown that current assessment methods for Markov graphs and Petri nets can be improved to a guarded transition system without a significant change of complexity.

84 citations


Network Information
Related Topics (5)
Control theory
299.6K papers, 3.1M citations
85% related
Control system
129K papers, 1.5M citations
85% related
Server
79.5K papers, 1.4M citations
85% related
Fuzzy logic
151.2K papers, 2.3M citations
85% related
Robustness (computer science)
94.7K papers, 1.6M citations
84% related
Performance
Metrics
No. of papers in the topic in previous years
YearPapers
2023290
2022662
2021466
2020574
2019651
2018751