Journal article icon

Journal article

Language Equivalence for Probabilistic Automata

Abstract:

We propose a new randomised algorithm for deciding language equivalence for probabilistic automata. This algorithm is based on polynomial identity testing and thus returns an answer with an error probability that can be made arbitrarily small. We implemented our algorithm, as well as deterministic algorithms of Tzeng and Doyen et al., optimised for running time whilst adequately handling issues of numerical stability. We conducted extensive benchmarking experiments, including the verification...

Expand abstract

Actions


Authors


Journal:
CAV More from this journal
Publication date:
2011-01-01
UUID:
uuid:1f72ff08-eb64-4001-bc2c-72b70af4a7d5
Local pid:
cs:4909
Deposit date:
2015-03-31

Terms of use


Views and Downloads






If you are the owner of this record, you can report an update to it here: Report update to this record

TO TOP