Verification of AA-Diagnosability in Probabilistic Finite Automata is PSPACE-Hard

Christoforos Keroglou, Christoforos N. Hadjicostis. Verification of AA-Diagnosability in Probabilistic Finite Automata is PSPACE-Hard. In 58th IEEE Conference on Decision and Control, CDC 2019, Nice, France, December 11-13, 2019. pages 6712-6717, IEEE, 2019. [doi]

Abstract

Abstract is missing.