On the High Complexity of Petri Nets $\omega$-Languages - Université Paris Cité Accéder directement au contenu
Communication Dans Un Congrès Année : 2020

On the High Complexity of Petri Nets $\omega$-Languages

Olivier Finkel
  • Fonction : Auteur
  • PersonId : 924907

Résumé

We prove that ω-languages of (non-deterministic) Petri nets and ω-languages of (non-deterministic) Turing machines have the same topological complexity: the Borel and Wadge hierarchies of the class of ω-languages of (non-deterministic) Petri nets are equal to the Borel and Wadge hierarchies of the class of ω-languages of (non-deterministic) Turing machines. We also show that it is highly undecidable to determine the topological complexity of a Petri net ω-language. Moreover, we infer from the proofs of the above results that the equivalence and the inclusion problems for ω-languages of Petri nets are Π^1_2-complete, hence also highly undecidable.
Fichier principal
Vignette du fichier
Final-version-Petri-nets-2020.pdf (355.5 Ko) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)
Loading...

Dates et versions

hal-02898143 , version 1 (13-07-2020)

Identifiants

  • HAL Id : hal-02898143 , version 1

Citer

Olivier Finkel. On the High Complexity of Petri Nets $\omega$-Languages. 41st International Conference on Application and Theory of Petri Nets and Concurrency, PETRI NETS 2020, Jun 2020, Paris, France. pp.69-88. ⟨hal-02898143⟩
82 Consultations
97 Téléchargements

Partager

Gmail Facebook X LinkedIn More