scholarly journals Characterization of Reachable Attractors Using Petri Net Unfoldings

Author(s):  
Thomas Chatain ◽  
Stefan Haar ◽  
Loïg Jezequel ◽  
Loïc Paulevé ◽  
Stefan Schwoon
Keyword(s):  
1991 ◽  
Vol 14 (4) ◽  
pp. 477-491
Author(s):  
Waldemar Korczynski

In this paper an algebraic characterization of a class of Petri nets is given. The nets are characterized by a kind of algebras, which can be considered as a generalization of the concept of the case graph of a (marked) Petri net.


Author(s):  
Dimitri Lefebvre ◽  
Edouard Leclercq ◽  
Souleiman Ould El Mehdi

Petri net models are used to detect and isolate faults in case of discrete event systems as manufacturing, robotic, communication and transportation systems. This chapter addresses two problems. The first one is the structure designs and parameters identification of the Petri net models according to the observation and analysis of the sequences of events that are collected. Deterministic and stochastic time Petri nets are concerned. The proposed method is based on a statistical analysis of data and has a practical interest as long as sequences of events are already saved by supervision systems. The second problem concerns the use of the resulting Petri net models to detect, isolate and characterize faults in discrete event systems. This contribution includes the characterization of intermittent faults. This issue is important because faults are often progressive from intermittent to definitive and early faults detection and isolation improve productivity and save money and resources.


1994 ◽  
Vol 20 (7) ◽  
pp. 506-515 ◽  
Author(s):  
G. Ciardo ◽  
R. German ◽  
C. Lindemann

1984 ◽  
Vol 13 (176) ◽  
Author(s):  
Kim Halskov Madsen

<p>In this paper we present a conceptual framework for the characterization of Petri net description techniques, and we apply this framework to characterize some well-known techniques.</p><p>The important point however, is that we feel that a conceptual framework (though perhaps not the one presented here) is essential for identifying and propagating description techniques. And surely for making progress in applications of nets, it is essential that we develop and communicate net description techniques that can deal with large systems.</p>


Author(s):  
Lorenzo Capra ◽  
Walter Cazzola

Industrial/business processes are an evident example of discrete-event systems which are subject to evolution during life-cycle. The design and management of dynamic workflows need adequate formal models and support tools to handle in sound way possible changes occurring during workflow operation. The known, well-established workflow’s models, among which Petri nets play a central role, are lacking in features for representing evolution. We propose a recent Petri net-based reflective layout, called Reflective Petri nets, as a formal model for dynamic workflows. A localized open problem is considered: how to determine what tasks should be redone and which ones do not when transferring a workflow instance from an old to a new template. The problem is efficiently but rather empirically addressed in a workflow management system. Our approach is formal, may be generalized, and is based on the preservation of classical Petri nets structural properties, which permit an efficient characterization of workflow’s soundness.


Sign in / Sign up

Export Citation Format

Share Document