Non-deterministic weighted automata evaluated over Markov chains

@article{Michaliszyn2019NondeterministicWA,
  title={Non-deterministic weighted automata evaluated over Markov chains},
  author={Jakub Michaliszyn and Jan Otop},
  journal={ArXiv},
  year={2019},
  volume={abs/1908.04625}
}
We present the first study of non-deterministic weighted automata under probabilistic semantics. In this semantics words are random events, generated by a Markov chain, and functions computed by weighted automata are random variables. We consider the probabilistic questions of computing the expected value and the cumulative distribution for such random variables. The exact answers to the probabilistic questions for non-deterministic automata can be irrational and are uncomputable in general… CONTINUE READING

References

Publications referenced by this paper.
SHOWING 1-10 OF 34 REFERENCES

Kwiatkowska , Gethin Norman , and David Parker . PRISM : A tool for automatic verification of probabilistic systems

Andrew Hinton, Z Marta
  • Nonlinear Analysis : Hybrid Systems
  • 2017

PRISM: A tool

Andrew Hinton, Marta Z. Kwiatkowska, Gethin Norman, David Parker
  • Nonlinear Analysis: Hybrid Systems,
  • 2017

Henzinger , and Jan Otop . Quantitative automata under probabilistic semantics

Krishnendu Chatterjee, A Thomas
  • In LICS
  • 2016

Strategy synthesis

Krishnendu Chatterjee, Mickael Randour, Jean-François Raskin
  • 2016

Convergence of probability measures

Patrick Billingsley
  • 2013