Anzeige
Erschienen in:
2013 | OriginalPaper | Buchkapitel
The Wadge Hierarchy of Petri Nets ω-Languages
verfasst von : Jacques Duparc, Olivier Finkel, Jean-Pierre Ressayre
Erschienen in: Logical Foundations of Computer Science
Verlag: Springer Berlin Heidelberg
Aktivieren Sie unsere intelligente Suche, um passende Fachinhalte oder Patente zu finden.
Wählen Sie Textabschnitte aus um mit Künstlicher Intelligenz passenden Patente zu finden. powered by
Markieren Sie Textabschnitte, um KI-gestützt weitere passende Inhalte zu finden. powered by
We describe the Wadge hierarchy of the
ω
-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
ω
-regular languages. Petri nets are an improvement of 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 every fixed number of partially blind counters.