Pith. sign in

REVIEW

The Decidability Frontier for Probabilistic Automata on Infinite Words

Not yet reviewed by Pith; the record is open.

Re-run · record.json Download PDF Read on arXiv ↗

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 1104.0127 v2 pith:HO2EAZXJ submitted 2011-04-01 cs.LO cs.FL

Krishnendu Chatterjee , Thomas A. Henzinger , Mathieu Tracol This is my paper
classification cs.LOcs.FL
keywords automataprobabilisticinfinitewordsconsiderdecidabilitydecisionfrontier
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
read the original abstract

We consider probabilistic automata on infinite words with acceptance defined by safety, reachability, B\"uchi, coB\"uchi, and limit-average conditions. We consider quantitative and qualitative decision problems. We present extensions and adaptations of proofs for probabilistic finite automata and present a complete characterization of the decidability and undecidability frontier of the quantitative and qualitative decision problems for probabilistic automata on infinite words.

Discussion (0). Sign in to comment.

Pith tools