@article{PARIGOT1985155,
    Abstract = {For languages recognized by finite automata we dispose of two formalisms: regular expressions (Kleene, 1956) and logical formulas (B{\"u}chi, 1960). In the case of Petri net languages there is no formalism like regular expressions. In this paper we give a B{\"u}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.},
    Author = {Parigot, Michel and Pelz, Elisabeth},
    File = {A logical approach of Petri net languages - 1-s2.0-0304397585901367-main.pdf},
    ISSN = {0304-3975},
    Journal = {Theoretical Computer Science},
    Note = {Third Conference on Foundations of Software Technology and Theoretical Computer Science},
    Pages = {155-169},
    Title = {A logical approach of Petri net languages},
    URL = {https://www.sciencedirect.com/science/article/pii/0304397585901367},
    Volume = {39},
    Year = {1985},
    bdsk-url-1 = {https://www.sciencedirect.com/science/article/pii/0304397585901367},
    bdsk-url-2 = {https://doi.org/10.1016/0304-3975(85)90136-7},
    date-added = {2022-07-01 12:43:06 +0200},
    date-modified = {2022-07-01 12:43:06 +0200},
    doi = {10.1016/0304-3975(85)90136-7}
}

@article{PARIGOT1985155, Abstract = {For languages recognized by finite automata we dispose of two formalisms: regular expressions (Kleene, 1956) and logical formulas (B{\"u}chi, 1960). In the case of Petri net languages there is no formalism like regular expressions. In this paper we give a B{\"u}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.}, Author = {Parigot, Michel and Pelz, Elisabeth}, File = {A logical approach of Petri net languages - 1-s2.0-0304397585901367-main.pdf}, ISSN = {0304-3975}, Journal = {Theoretical Computer Science}, Note = {Third Conference on Foundations of Software Technology and Theoretical Computer Science}, Pages = {155-169}, Title = {A logical approach of Petri net languages}, URL = {https://www.sciencedirect.com/science/article/pii/0304397585901367}, Volume = {39}, Year = {1985}, bdsk-url-1 = {https://www.sciencedirect.com/science/article/pii/0304397585901367}, bdsk-url-2 = {https://doi.org/10.1016/0304-3975(85)90136-7}, date-added = {2022-07-01 12:43:06 +0200}, date-modified = {2022-07-01 12:43:06 +0200}, doi = {10.1016/0304-3975(85)90136-7} }