ANN 发表于 2025-4-1 02:02:23

Probabilistic Automata on Infinite Words: Decidability and Undecidability Results consider quantitative and qualitative decision problems. We present extensions and adaptations of proofs for probabilistic finite automata and present an almost complete characterization of the decidability and undecidability frontier of the quantitative and qualitative decision problems for probabilistic automata on infinite words.
页: 1 2 3 4 5 6 [7]
查看完整版本: Titlebook: Automated Technology for Verification and Analysis; 8th International Sy Ahmed Bouajjani,Wei-Ngan Chin Conference proceedings 2010 Springer