scientific article; zbMATH DE number 5631271

MaRDI QIDQ3642015zbMATH OpenFDO

Authors Feng Yu, Junzhou Luo, Wei Li

Publication date 11 November 2009

zbMATH Keywords

reachabilityPetri netT-invariantlegal firing transition sequence

Mathematics Subject Classification ID

Network design and communication in computer systems (68M10)

Recommendations

• Optimal legal firing sequence of Petri nets using linear programming
• A heuristic algorithm FSDC based on avoidance of deadlock components in finding legal firing sequences of Petri nets
• Polynomial-time algorithm for the legal firing sequences problem of a type of synchronous composition Petri nets
• A Reachability Algorithm for General Petri Nets Based on Transition Invariants
• scientific article; zbMATH DE number 522857
• scientific article; zbMATH DE number 4127001
• Firing sequences and processes of Petri nets
• T-invariants for jumping Petri nets
• Reachability analysis in T-invariant-less petri nets
• Deciding a class of path formulas for conflict-free Petri nets

Cited in

(2)

• A heuristic algorithm FSDC based on avoidance of deadlock components in finding legal firing sequences of Petri nets
• Polynomial-time algorithm for the legal firing sequences problem of a type of synchronous composition Petri nets

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3642015)