On the Topological Complexity of omega-Languages of Non-Deterministic Petri Nets - Archive ouverte HAL
Journal Articles Information Processing Letters Year : 2014

On the Topological Complexity of omega-Languages of Non-Deterministic Petri Nets

Abstract

We show that there are $\Sigma_3^0$-complete languages of infinite words accepted by non-deterministic Petri nets with Büchi acceptance condition, or equivalently by Büchi blind counter automata. This shows that omega-languages accepted by non-deterministic Petri nets are topologically more complex than those accepted by deterministic Petri nets.

Domains

Logic in Computer Science [cs.LO] Computational Complexity [cs.CC]
Fichier principal
Vignette du fichier
non-det-petri-nets.pdf (123.97 Ko) Télécharger le fichier
Origin Files produced by the author(s)

Olivier Finkel  : Connect in order to contact the contributor

https://hal.science/hal-00936744

Submitted on : Monday, January 27, 2014-1:23:52 PM

Last modification on : Tuesday, November 26, 2024-8:48:03 AM

Long-term archiving on : Sunday, April 27, 2014-10:37:37 PM

Download

Dates and versions

hal-00936744 , version 1 (27-01-2014)

Identifiers

Cite

Olivier Finkel, Michał Skrzypczak. On the Topological Complexity of omega-Languages of Non-Deterministic Petri Nets. Information Processing Letters, 2014, 114 (5), pp.229-233. ⟨hal-00936744⟩

Export

BibTeX XML-TEI Dublin Core DC Terms EndNote DataCite

Collections

UNIV-PARIS7 UPMC CNRS ELM IMJ IMJ_LOG SORBONNE-UNIVERSITE SU-SCIENCES UP-SCIENCES
138 View
100 Download

Altmetric

Share

More