Abstract

For languages recognized by finite automata we dispose of two formalisms: regular expressions (Kleene, 1956) and logical formulas (Büchi, 1960). In the case of Petri net languages there is no formalism like regular expressions. In this paper we give a Büchi-like theorem which characterizes Petri net languages in terms of second-order logical formulas. This characterization has two advantages: (1) It situates exactly the power of Petri nets with respect to finite automata; roughly speaking, Petri nets are finite automata plus the ability of testing if a string of parenthesis is well formed (in this paper ‘parenthesis’ always means the usual one sort of parentheses). (2) Given a language, it enables us to easily prove that it is a Petri net language. In addition we prove that Petri net languages and deadlock languages coincide.

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.