The Wadge Hierarchy of Petri Nets omega-Languages - Archive ouverte HAL
Book Sections Year : 2014

The Wadge Hierarchy of Petri Nets omega-Languages

Abstract

We describe the Wadge hierarchy of the omega-languages recognized by deterministic Petri nets. This is an extension of the celebrated Wagner hierarchy which turned out to be the Wadge hierarchy of the omega-regular languages. Petri nets are more powerful devices than finite automata. They may be defined as partially blind multi-counter automata. We show that the whole hierarchy has height $\omega^{\omega^2}$, and give a description of the restrictions of this hierarchy to partially blind multi-counter automata of some fixed positive number of counters.
Fichier principal
Vignette du fichier
Petri-Nets-revised.pdf (353.49 Ko) Télécharger le fichier
Origin Files produced by the author(s)
Loading...

Dates and versions

hal-00743510 , version 1 (19-10-2012)
hal-00743510 , version 2 (05-04-2013)
hal-00743510 , version 3 (23-10-2014)

Identifiers

  • HAL Id : hal-00743510 , version 3

Cite

Jacques Duparc, Olivier Finkel, Jean-Pierre Ressayre. The Wadge Hierarchy of Petri Nets omega-Languages. Vasco Brattka, Hannes Diener, and Dieter Spreen. Logic, Computation, Hierarchies, Festschrift Volume in Honor of Victor Selivanov at the occasion of his sixtieth birthday., 4, De Gruyter, pp.109-138, 2014, Ontos Mathematical Logic, 978-1-61451-804-4. ⟨hal-00743510v3⟩
607 View
511 Download

Share

More