Reachability in live and safe free-choice Petri nets is NP-complete

Introduction to automata theory, languages and computation

Mathematics and Computers in Simulation · 1981 · 10.9K citations

Computing, Computer Science, Mathematics +10

Introduction to automata theory, languages, and computation

Computer Languages · 1980 · 6.9K citations

Computing, Computer Science, Mathematics +10

ANALYSIS OF PRODUCTION SCHEMATA BY PETRI NETS

M. Hack · DSpace@MIT (Massachusetts Institute of Technology) · 1972 · 326 citations · Full text

Engineering, Systems Engineering, Production Engineering +11

A polynomial-time algorithm to decide liveness of bounded free choice nets

Javier Esparza, Manuel Silva · Theoretical Computer Science · 1992 · 70 citations

Computing, Computer Science, Mathematics +5

Reachability in cyclic extended free-choice systems

Jörg Desel, Javier Esparza · Theoretical Computer Science · 1993 · 39 citations

Natural Sciences, Mathematics, Dynamical Systems +3