A polynomial-time graph algorithm to decide liveness of some basic classes of bounded Petri nets

This publication has 13 references indexed in Scilit:

• Deadlocks and traps in Petri nets as Horn-satisfiability solutions and some related polynomially solvable problems
  Discrete Applied Mathematics, 1990
• LTUR: a simplified linear-time unit resolution algorithm for horn formulae and computer implementation
  Information Processing Letters, 1988
• Place/Transition Systems
  Published by Springer Nature ,1987
• Transformations and Decompositions of Nets
  Published by Springer Nature ,1987
• Some Classes of Live and Safe Petri Nets
  Published by Springer Nature ,1987
• Linear Algebraic Calculation of Deadlocks and Traps
  Published by Springer Nature ,1987
• An Algorithm for the General Petri Net Reachability Problem
  SIAM Journal on Computing, 1984
• A simple and Fast Algorithm to Obtain all Invariants of a Generalised Petri Net
  Informatik-Fachberichte, 1982
• Complexity of some problems in Petri nets
  Theoretical Computer Science, 1977
• Depth-First Search and Linear Graph Algorithms
  SIAM Journal on Computing, 1972