scholarly journals Acceleration For Presburger Petri Nets

10.29007/8wkd ◽  
2018 ◽  
Author(s):  
Jerome Leroux
Keyword(s):  
Petri Nets ◽  
Petri Net ◽  
Open Problem ◽  
Direct Consequence ◽  
Reachability Problem ◽  
Presburger Arithmetic ◽  
Acceleration Techniques ◽  
Reachability Set ◽  
Bounded Language ◽  
Inductive Invariants

The reachability problem for Petri nets is a central problem of net theory. The problem is known to be decidable by inductive invariants definable in the Presburger arithmetic. When the reachability set is definable in the Presburger arithmetic, the existence of such an inductive invariant is immediate. However, in this case, the computation of a Presburger formula denoting the reachability set is an open problem. Recently this problem got closed by proving that if the reachability set of a Petri net is definable in the Presburger arithmetic, then the Petri net is flatable, i.e. its reachability set can be obtained by runs labeled by words in a bounded language. As a direct consequence, classical algorithms based on acceleration techniques effectively compute a formula in the Presburger arithmetic denoting the reachability set.

scholarly journals PATH DECOMPOSITION AND SEMILINEARITY OF PETRI NETS

2009 ◽  
Vol 20 (04) ◽  
pp. 581-596 ◽  
Author(s):  
HSU-CHUN YEN
Keyword(s):  
Petri Nets ◽  
Petri Net ◽  
Sufficient Conditions ◽  
Formal Languages ◽  
Path Decomposition ◽  
Reachability Sets ◽  
Reachability Set

Semilinearity plays a key role not only in formal languages but also in the study of Petri nets. Although the reachability set of a Petri net may not be semilinear in general, there are a wide variety of subclasses of Petri nets which enjoy having semilinear reachability sets. In this paper, we develop sufficient conditions for Petri nets under which semilinearity is guaranteed. Our approach, based on the idea of path decomposition, can be used for consolidating several existing semilinearity results as well as for deriving new results all under the same framework.

A CONSTRUCTIVE METHOD FOR FINDING LEGAL TRANSITION SEQUENCES IN PETRI NETS

1998 ◽  
Vol 08 (01) ◽  
pp. 189-222 ◽  
Author(s):  
JENG S. HUANG ◽  
TADAO MURATA
Keyword(s):  
Petri Nets ◽  
Petri Net ◽  
Nonnegative Integer ◽  
State Equation ◽  
The State ◽  
Constructive Method ◽  
Reachability Problem ◽  
Search Effort ◽  
Representation Systems ◽  
Integer Solutions

This paper considers the Petri net reachability problem formulated in terms of nonnegative integer solutions of the state equation and their net representation systems. Our main contributions are twofold. First, we show that algorithms for finding legal transition sequences can be easily given for subclasses of Petri nets where reachability criteria are known or can be formulated by our method. Second, for the general reachability problem where reachability theorems or criteria are not known, and thus an exhaustive search for legal transition sequences is inevitable, we introduce the notion of non-crucial sequences to reduce the search effort.

scholarly journals Petri nets properties related to the unboundness and analyzed using coverability multigraph

2014 ◽  
Vol 10 (2) ◽  
pp. 51-67 ◽  
Author(s):  
Branislav Hrúz ◽  
Iveta Dirgová Ľuptáková ◽  
Miroslav Beňo
Keyword(s):  
Petri Nets ◽  
State Space ◽  
Petri Net ◽  
Discrete Event Systems ◽  
Discrete Event ◽  
System Model ◽  
Reachability Graph ◽  
Reachability Set ◽  
Event Systems ◽  
System States

Abstract Petri nets represent a powerful tool for modeling the discrete event systems. The Petri net markings correspond to the system states. The infinity of the marking set means that the Petri net is unbounded and this may be the sign of an incorrect system model. In that case instead of the reachability set and the reachability graph the coverability set and the coverability multigraph can be used to represent the Petri net state space. A systematic way of building the notion of the coverability set and coverability multigraph based on the notion of the ω -marking is given in the paper. Algorithm for its construction is introduced. Then the use of the coverability multigraph for the analysis of several properties of the unbounded Petri nets is described.

Constrained Petri Nets. Part II: Generalizations and extensions

1983 ◽  
Vol 6 (3-4) ◽  
pp. 333-374
Author(s):  
H.J.M. Goeman ◽  
L.P.J. Groenewegen ◽  
H.C.M. Kleijn ◽  
G. Rozenberg
Keyword(s):  
Petri Nets ◽  
Petri Net ◽  
Theoretical Framework ◽  
General Constraints ◽  
Context Free ◽  
Boolean Expressions

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.

An Axiomatic Characterization of a Class of Petri Nets

1991 ◽  
Vol 14 (4) ◽  
pp. 477-491
Author(s):  
Waldemar Korczynski
Keyword(s):  
Petri Nets ◽  
Petri Net ◽  
Axiomatic Characterization ◽  
Algebraic Characterization

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.

The Quantitative Assessment of Domino Effects Based on Stochastic Petri Nets

2008 ◽  
Vol 44-46 ◽  
pp. 537-544
Author(s):  
Shi Yi Bao ◽  
Jian Xin Zhu ◽  
Li J. Wang ◽  
Ning Jiang ◽  
Zeng Liang Gao
Keyword(s):  
Petri Nets ◽  
State Space ◽  
Petri Net ◽  
Quantitative Assessment ◽  
Stochastic Petri Nets ◽  
Industrial Park ◽  
Domino Effect ◽  
State Space Explosion ◽  
Stochastic Petri Net ◽  
Chemical Industrial Park

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.

THE APPLICATION OF PETRI NETS TO WORKFLOW MANAGEMENT

1998 ◽  
Vol 08 (01) ◽  
pp. 21-66 ◽  
Author(s):  
W. M. P. VAN DER AALST
Keyword(s):  
Petri Nets ◽  
Petri Net ◽  
Business Processes ◽  
State Of The Art ◽  
Workflow Management ◽  
Explicit Representation ◽  
The Other ◽  
Application Domain ◽  
Analysis Techniques ◽  
The One

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.

Hierarchical Configurable Petri Net Modeling in VHDL

2012 ◽  
Vol 58 (4) ◽  
pp. 397-402 ◽  
Author(s):  
Michał Doligalski ◽  
Marian Adamski
Keyword(s):  
Petri Nets ◽  
Petri Net ◽  
Control Process ◽  
Discrete Control ◽  
Dual Model ◽  
Description Language ◽  
Direct Support ◽  
Hardware Description ◽  
Logical Synthesis ◽  
State Machine Diagram

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

TOWARD UNDERSTANDING THE GENERATIVE CAPACITY OF ERASING RULES IN MATRIX GRAMMARS

2011 ◽  
Vol 22 (02) ◽  
pp. 411-426 ◽  
Author(s):  
GEORG ZETZSCHE
Keyword(s):  
Petri Net ◽  
Open Problem ◽  
Generative Capacity ◽  
Arbitrary Matrix ◽  
Matrix Grammar ◽  
Sentential Form

This article presents approaches to the open problem of whether erasing rules can be eliminated in matrix grammars. The class of languages generated by non-erasing matrix grammars is characterized by the newly introduced linear Petri net grammars. Petri net grammars are known to be equivalent to arbitrary matrix grammars (without appearance checking). In linear Petri net grammars, the marking has to be linear in size with respect to the length of the sentential form. The characterization by linear Petri net grammars is then used to show that applying linear erasing to a Petri net language yields a language generated by a non-erasing matrix grammar. It is also shown that in Petri net grammars (with final markings and arbitrary labeling), erasing rules can be eliminated, which yields two reformulations of the problem of whether erasing rules in matrix grammars can be eliminated.

Sign in / Sign up

Export Citation Format

Share Document