Coverability, Termination, and Finiteness in Recursive Petri Nets
| Autor: | Alain Finkel, Serge Haddad, Igor Khmelnitsky |
|---|---|
| Jazyk: | angličtina |
| Rok vydání: | 2021 |
| Předmět: |
FOS: Computer and information sciences
Computer Science - Logic in Computer Science Algebra and Number Theory TheoryofComputation_COMPUTATIONBYABSTRACTDEVICES TheoryofComputation_MATHEMATICALLOGICANDFORMALLANGUAGES Computational Theory and Mathematics Formal Languages and Automata Theory (cs.FL) Computer Science - Formal Languages and Automata Theory Information Systems Theoretical Computer Science Logic in Computer Science (cs.LO) |
| Popis: | In the early two-thousands, Recursive Petri nets have been introduced in order to model distributed planning of multi-agent systems for which counters and recursivity were necessary. Although Recursive Petri nets strictly extend Petri nets and context-free grammars, most of the usual problems (reachability, coverability, finiteness, boundedness and termination) were known to be solvable by using non-primitive recursive algorithms. For almost all other extended Petri nets models containing a stack, the complexity of coverability and termination are unknown or strictly larger than EXPSPACE. In contrast, we establish here that for Recursive Petri nets, the coverability, termination, boundedness and finiteness problems are EXPSPACE-complete as for Petri nets. From an expressiveness point of view, we show that coverability languages of Recursive Petri nets strictly include the union of coverability languages of Petri nets and context-free languages. Thus we get a more powerful model than Petri net for free. |
| Databáze: | OpenAIRE |
| Externí odkaz: |
|