Hierarchical Configurable Petri Net Modeling in VHDL

2012 ◽  
Vol 58 (4) ◽  
pp. 397-402 ◽  
Author(s):  
Michał Doligalski ◽  
Marian Adamski

Abstract The paper presents method for hierarchical configurable Petri nets description in VHDL language. Dual model is an alternative way for behavioral description of the discrete control process. Dual model consists of two correlated models: UML state machine diagram and hierarchical configurable Petri net (HCfgPN). HCfgPN are Petri nets variant with direct support of exceptions handling mechanism. Logical synthesis of dual model is realized by the description of HCfgPN model by means of hardware description language. The paper presents placesoriented method for HCfgPN description in VHDL language

1981 ◽  
Vol 8 (96) ◽  
Author(s):  
Kurt Jensen ◽  
Morten Kyng ◽  
Ole Lehrmann Madsen

<p>This paper introduces a language, Epsilon, for the description of systems with concurrency, and presents a formal definition of Epsilon's semantics. The language is based on Delta ‹ the first major attempt to create a language solely aimed at system description without the restrictions placed on languages executable on digital computers. The design of Delta was itself heavily influenced by the experience from the development and use of Simula.</p><p>It is not obvious what kind of semantics a system description language should have. The situation is more complex than with normal algorithmic languages and none of the existing semantic approaches appear to be satisfactory.</p><p>To clarify the situation, we first describe the language Epsilon, which contains only a few basic primitives. Then we define the semantics of Epsilon by means of a formal model based on Petri nets. The model called ''Concurrent systems'' is an extension of Petri nets with a data part and with expressions attached to transitions and to places. The model is a further development of formalisms proposed by R.M. Keller and A. Mazurkiewicz. The expressions attached to places is a novel feature and is used to define continuous transformations on the data part. The semantics of a given system description is defined in terms of firing sequences of the corresponding concurrent system.</p><p>To be presented at the Evian Conference on Semantics of Concurrent Computations, July 1979.</p>


2012 ◽  
Vol 58 (1) ◽  
pp. 43-48 ◽  
Author(s):  
Michał Doligalski ◽  
Marian Adamski

Petri Net Based Specification in the Design of Logic Controllers with Exception Handling Mechanism Hierarchical Petri nets beside UML state machine diagrams, sequentional function charts (SFC) and hierarchical concurrent state machines are common solution for specification of logic controllers. These specification formats provide both concurrency and modeling on multi levels of abstraction (hierarchic approach). But only state machine diagrams supports exceptions handling in direct way. Program model presented in form of state machine diagram may be later transformed into a program in the SFC language or transformed in the Petri Net and implemented in the FPGA structure. Similarity between SFC language and Petri Nets give us lot of tools for analysis such control system. Article presents new approach for exceptions handling in hierarchical Petri nets as formal specification for logic controllers. Proposed method of specification can be used independently or as a part of dual specification (correlated state machine diagram and hierarchical configurable Petri Net).


1983 ◽  
Vol 6 (3-4) ◽  
pp. 333-374
Author(s):  
H.J.M. Goeman ◽  
L.P.J. Groenewegen ◽  
H.C.M. Kleijn ◽  
G. Rozenberg

This paper continues the investigation froll1 [Goeman et al.] concerning the use of sets of places of a Petri net as additional (to input places) constraints for granting concession. Now interpretations of more general constraints are considered and expressed as Boolean expressions. This gives rise to various classes of constrained Petri nets. These are compared in the language theoretical framework introduced in [Goeman et al.]. An upperbound for the language defining power is found in the class of context-free programmed languages.


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.


2008 ◽  
Vol 44-46 ◽  
pp. 537-544
Author(s):  
Shi Yi Bao ◽  
Jian Xin Zhu ◽  
Li J. Wang ◽  
Ning Jiang ◽  
Zeng Liang Gao

The quantitative analysis of “domino” effects is one of the main aspects of hazard assessment in chemical industrial park. This paper demonstrates the application of heterogeneous stochastic Petri net modeling techniques to the quantitative assessment of the probabilities of domino effects of major accidents in chemical industrial park. First, five events are included in the domino effect models of major accidents: pool fire, explosion, boiling liquid expanding vapour explosion (BLEVE) giving rise to a fragment, jet fire and delayed explosion of a vapour cloud. Then, the domino effect models are converted into Generalized Stochastic Petri net (GSPN) in which the probability of the domino effect is calculated automatically. The Stochastic Petri nets’ models, which are state-space based ones, increase the modeling flexibility but create the state-space explosion problems. Finally, in order to alleviate the state-space explosion problems of GSPN models, this paper employs Stochastic Wellformed Net (SWN), a particular class of High-Level (colored) SPN. To conduct a case study on a chemical industrial park, the probability of domino effects of major accidents is calculated by using the GSPN model and SWN model in this paper.


1998 ◽  
Vol 08 (01) ◽  
pp. 21-66 ◽  
Author(s):  
W. M. P. VAN DER AALST

Workflow management promises a new solution to an age-old problem: controlling, monitoring, optimizing and supporting business processes. What is new about workflow management is the explicit representation of the business process logic which allows for computerized support. This paper discusses the use of Petri nets in the context of workflow management. Petri nets are an established tool for modeling and analyzing processes. On the one hand, Petri nets can be used as a design language for the specification of complex workflows. On the other hand, Petri net theory provides for powerful analysis techniques which can be used to verify the correctness of workflow procedures. This paper introduces workflow management as an application domain for Petri nets, presents state-of-the-art results with respect to the verification of workflows, and highlights some Petri-net-based workflow tools.


Sign in / Sign up

Export Citation Format

Share Document