Diagnosis in infinite-state probabilistic systems
N Bertrand, S Haddad… - … on Concurrency Theory …, 2016 - drops.dagstuhl.de
In a recent work, we introduced four variants of diagnosability (FA, IA, FF, IF) in (finite)
probabilistic systems (pLTS) depending whether one considers (1) finite or infinite runs and
(2) faulty or all runs. We studied their relationship and established that the corresponding
decision problems are PSPACE-complete. A key ingredient of the decision procedures was
a characterisation of diagnosability by the fact that a random run almost surely lies in an
open set whose specification only depends on the qualitative behaviour of the pLTS. Here …
probabilistic systems (pLTS) depending whether one considers (1) finite or infinite runs and
(2) faulty or all runs. We studied their relationship and established that the corresponding
decision problems are PSPACE-complete. A key ingredient of the decision procedures was
a characterisation of diagnosability by the fact that a random run almost surely lies in an
open set whose specification only depends on the qualitative behaviour of the pLTS. Here …
Diagnosis in infinite-state probabilistic systems (long version)
In a recent work, we introduced four variants of diagnosability (FA, IA, FF, IF) in (finite)
probabil-istic systems (pLTS) depending whether one considers (1) finite or infinite runs and
(2) faulty or all runs. We studied their relationship and established that the corresponding
decision problems are PSPACE-complete. A key ingredient of the decision procedures was
a characterisation of diagnosability by the fact that a random run almost surely lies in an
open set whose specification only depends on the qualitative behaviour of the pLTS. Here …
probabil-istic systems (pLTS) depending whether one considers (1) finite or infinite runs and
(2) faulty or all runs. We studied their relationship and established that the corresponding
decision problems are PSPACE-complete. A key ingredient of the decision procedures was
a characterisation of diagnosability by the fact that a random run almost surely lies in an
open set whose specification only depends on the qualitative behaviour of the pLTS. Here …
Showing the best results for this search. See all results