On the topological complexity of ω-languages of non-deterministic Petri nets

Authors:
Olivier Finkel;Michał Skrzypczak
Affiliations:
Equipe de Logique Mathématique, Institut de Mathématiques de Jussieu-Paris Rive Gauche, CNRS et Université Paris Diderot-Paris 7, UFR de Mathématiques, case 7012, 75205 Paris C ...;Institute of Informatics, University of Warsaw, Banacha 2, 02-097 Warsaw, Poland
Venue:
Information Processing Letters
Year:
2014

Citing 9
Cited 0

Automata on infinite objects

Handbook of theoretical computer science (vol. B)
X-automata on &ohgr;-words

Theoretical Computer Science
&ohgr;-languages

Handbook of formal languages, vol. 3
Decidability and Complexity of Petri Net Problems - An Introduction

Lectures on Petri Nets I: Basic Models, Advances in Petri Nets, the volumes are based on the Advanced Course on Petri Nets
An Effective Extension of the Wagner Hierarchy to Blind Counter Automata

CSL '01 Proceedings of the 15th International Workshop on Computer Science Logic
Logical Specifications of Infinite Computations

A Decade of Concurrency, Reflections and Perspectives, REX School/Symposium
Infinite Behaviour if Deterministic Petri Nets

MFCS '88 Proceedings of the Mathematical Foundations of Computer Science 1988
Borel ranks and Wadge degrees of context free $\omega$-languages

Mathematical Structures in Computer Science
Fine hierarchies and m-reducibilities in theoretical computer science

Theoretical Computer Science

Quantified Score

Hi-index	0.89

Visualization

Abstract

We show that there are @S"3^0-complete languages of infinite words accepted by non-deterministic Petri nets with Buchi acceptance condition, or equivalently by Buchi blind counter automata. This shows that @w-languages accepted by non-deterministic Petri nets are topologically more complex than those accepted by deterministic Petri nets.