On the Regularity of Petri Net Languages

• 1 February 1996
• journal article
• Published by Elsevier in Information and Computation
• Vol. 124  (2) , 168-181
• https://doi.org/10.1006/inco.1996.0013

Abstract

Keywords

• COMPUTATIONAL COMPLEXITY
• POLYNOMIAL TIME
• PETRI NET
• UPPER BOUND