A polynomial algorithm to find a set of elementary siphons in a class of Petri Nets

Document Type

Conference Proceeding

Publication Date

12-1-2004

Abstract

The concept of siphons plays an important role in the analysis of Petri nets. In particular, criteria for liveness and reachability of some subclasses of Petri nets can be stated in terms of siphons. However, the computation of these structural components can be time-consuming or even impossible. Recently, a variety of deadlock control policies that rely on partial siphon computation and enumeration have been developed. In this paper we propose a polynomial algorithm to find a set of elementary siphons in a class of Petri nets called systems of simple sequential processes with resources, S3 PR for short. Based on them, other siphons, called dependent ones, can be composed by simple set operations. Case studies show that the proposed algorithm is more computationally efficient than INA, Integrated Net Analyzer, a widely used Petri net analysis tool. © 2004 IEEE.

Identifier

15744385448 (Scopus)

ISBN

[0780385667]

Publication Title

Conference Proceedings IEEE International Conference on Systems Man and Cybernetics

External Full Text Location

https://doi.org/10.1109/ICSMC.2004.1401301

ISSN

1062922X

First Page

4861

Last Page

4866

Volume

5

This document is currently not available here.

Share

COinS