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 published on a yearly basis
Papers
More filters
••
TL;DR: The framework consists of three techniques: workflow control tables, sequence constraints, and event-based workflow management rules that are applied to the case of consumer loan management and compared with other approaches based on static routing.
Abstract: Businesses around the world are paying more attention to process management and process automation to improve organizational efficiency and effectiveness. In this paper, we describe a general framework for implementing dynamic routing and operational control mechanisms in Workflow Management Systems (WMSs). The framework consists of three techniques: workflow control tables, sequence constraints, and event-based workflow management rules. Our approach offers several unique features that are missing in commercial workflow management systems: (1) it provides more flexibility in process modeling and control; (2) it permits rework on an ad hoc basis; (3) it handles exceptions to routing and operational controls; and (4) it exploits parallelism to increase system throughput and response time. Finally, the workflow management techniques are applied to the case of consumer loan management and compared with other approaches based on static routing.
107 citations
••
16 Oct 2000TL;DR: This paper shows that the recently introduced logic CSL (continuous stochastic logic) provides ample means to specify state- as well as path-based dependability measures in a compact and flexible way and can exploit the structure of CSL-specified dependable measures in the dependability evaluation process.
Abstract: Over the last two decades, many techniques have been developed to specify and evaluate Markovian dependability models. Most often, these Markovian models are automatically derived from stochastic Petri nets, stochastic process algebras or stochastic activity networks. However, whereas the model specification has become very comfortable, the specification of the dependability measures of interest most often has remained fairly cumbersome. In this paper, we show that our recently introduced logic CSL (continuous stochastic logic) provides ample means to specify state- as well as path-based dependability measures in a compact and flexible way. Moreover, due to the formal syntax and semantics of CSL, we can exploit the structure of CSL-specified dependability measures in the dependability evaluation process. Typically, the underlying Markov chains that need to be evaluated can be reduced considerably in size by this structure exploitation.
107 citations
••
01 May 1997TL;DR: A new method of detecting fault locations in power networks using Petri net models that can reduce processing time and increase accuracy when compared with the traditional pattern recognition and hypotheses testing methods is proposed.
Abstract: A new method of detecting fault locations in power networks is proposed. The diagnostic process uses Petri net models. This can reduce processing time and increase accuracy when compared with the traditional pattern recognition and hypotheses testing methods. The method is more able than previous methods to adapt to changing network configurations. The methodology was tested using the IEEE 118-bus standard test system. Fast and accurate results were obtained. The method is very suitable for online applications.
107 citations
••
TL;DR: It is shown how a 1-safe Petri net and a requirement on the behaviour of the net can be translated into a logic program such that the bounded model checking problem for theNet can be solved by computing stable models of the corresponding program.
Abstract: In this paper, bounded model checking of asynchronous concurrent systems is introduced as a promising application area for answer set programming. As the model of asynchronous systems a generalisation of communicating automata, 1-safe Petri nets, are used. It is shown how a 1-safe Petri net and a requirement on the behaviour of the net can be translated into a logic program such that the bounded model checking problem for the net can be solved by computing stable models of the corresponding program. The use of the stable model semantics leads to compact encodings of bounded reachability and deadlock detection tasks as well as the more general problem of bounded model checking of linear temporal logic. Correctness proofs of the devised translations are given, and some experimental results using the translation and the Smodels system are presented.
107 citations
01 Jul 1985
107 citations