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

Christoforos Keroglou Christoforos N. Hadjicostis

Published in: CDC (2019)

Keyphrases

finite automata
probability function
grammatical inference
deterministic automata
regular expressions
probabilistic automata
tree automata
model checking
probabilistic model
artificial intelligence
hidden markov models
fault diagnosis
finite automaton
pattern matching
prior probabilities
discrete event systems