A heuristic algorithm FMDB for the minimum initial marking problem of Petri nets

IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences

Volumn E84-A, Issue 3, 2001, Pages 771-780

  Nishi, S ^a   Taoka, S ^a   Watanabe, T ^a  

^a HIROSHIMA UNIVERSITY   (Japan)

Author keywords

Deficient siphons; Legal firing sequences; Minimal initial markings; Petri nets

Indexed keywords

HEURISTIC METHODS; MATHEMATICAL MODELS; PERFORMANCE; PETRI NETS; PROBLEM SOLVING;

FIRING COUNT VECTOR; HEURISTIC ALGORITHM; LEGAL FIRING SEQUENCE; MINIMUM INITIAL MARKING;

ALGORITHMS;

EID: 0035274011     PISSN: 09168508     EISSN: None     Source Type: Journal    
DOI: None     Document Type: Conference Paper

References (16)

1. Heuristic algorithms for the legal firing sequence and related problems of Petri nets
2. Initial markings at which firing count vector has firable firing sequences in Petri net
3. Petri nets: Properties, analysis and applications
4. A heuristic algorithm FMD for the minimum initial marking problem of Petri nets
5. On optimizing the initial token distribution for a periodic Petri net firing sequence with prescribed firing numbers
6. Petri nets/an introduction
7. Finding minimal siphons in general Petri nets
8. Minimum initial marking problems of Petri nets
9. Time complexity of legal firing sequence and related problems of Petri nets
10. The minimum initial marking problem for scheduling in timed Petri nets
11. An approximation algorithm for the legal firing sequence problem of Petri nets
12. A heuristic algorithm for the minimum initial marking problem of Petri net
13. A heuristic algorithm FSD for the legal firing sequence problem of Petri nets