We show that several problems that are undecidable for the classical questions of emptiness and universality become decidable under the probabilistic semantics.

Apr 22, 2016 · We study for the first time such quantitative automata under probabilistic semantics. We show that several problems that are undecidable for the ...

We show that several problems that are undecidable for the classical questions of emptiness and universality become decidable under the probabilistic semantics.

Aug 13, 2019 · We present a complete picture of decidability for nested weighted automata and automata with monitor counters under probabilistic semantics.

We study for the first time such quantitative automata under probabilistic semantics. We show that several problems that are undecidable for the classical ...

It is shown that several problems that are undecidable for the classical questions of emptiness and universality become decidable under the probabilistic ...

We present a complete picture of decid- ability for nested weighted automata and automata with monitor counters under probabilistic semantics. Automata with ...

For a well-studied and wide class of quantitative functions, we establish that automata with monitor counters and nested weighted automata are equivalent. We ...

Otop, “Quantitative automata under probabilistic semantics,” in Proceedings of the 31st Annual ACM/IEEE Symposium, New York, NY, USA, 2016, pp. 76–85.

We study for the first time such quantitative automata under probabilistic semantics. We show that several problems that are undecidable for the classical ...