A linear time algorithm solving the legal firing sequence problem for a class of edge-weighted cactuses

The subject of the paper is the legal firing sequence problem of Petri nets (LFS): given a Petri net N, an initial marking M and a firing count vector X, find a firing sequence /spl sigma/, starting from M, such that each transition t appears in /spl sigma/ exactly X(t) times as prescribed by X. The...

Full description

Saved in:
Bibliographic Details
Published in:IEEE SMC'99 Conference Proceedings. 1999 IEEE International Conference on Systems, Man, and Cybernetics (Cat. No.99CH37028) Vol. 3; pp. 893 - 898 vol.3
Main Authors: Taoka, S., Watanabe, T.
Format: Conference Proceeding
Language:English
Japanese
Published: IEEE 20.01.2003
Subjects:
Circuits and systems
Graph theory
Law
Legal factors
Petri nets
Systems engineering and theory
Terminology
Vectors
ISBN:9780780357310, 0780357310
ISSN:1062-922X
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:The subject of the paper is the legal firing sequence problem of Petri nets (LFS): given a Petri net N, an initial marking M and a firing count vector X, find a firing sequence /spl sigma/, starting from M, such that each transition t appears in /spl sigma/ exactly X(t) times as prescribed by X. The main result of the paper is as follows: LFS is solvable in linear time if N is a cyclic cactus with exactly two kinds of edge-weights and X=1~, meaning that X(t)=1 for every transition t.
ISBN:9780780357310
0780357310
ISSN:1062-922X
DOI:10.1109/ICSMC.1999.823346