Browsing by Subject "Probabilistic automata"

Now showing items 1-4 of 4

    • Conference Object  

      Initial state opacity in stochastic des 

      Keroglou, C.; Hadjicostis, Christoforos N. (2013)
      A non-deterministic finite automaton is initial-state opaque if the membership of its true initial state to a given set of secret states S remains opaque (i.e., uncertain) to an intruder who observes system activity through ...
    • Article  

      Maximum likelihood failure diagnosis in finite state machines under unreliable observations 

      Athanasopoulou, E.; Li, L.; Hadjicostis, Christoforos N. (2010)
      In this paper, we develop a probabilistic methodology for failure diagnosis in finite state machines based on a sequence of unreliable observations. Given prior knowledge of the input probability distribution but without ...
    • Conference Object  

      Opacity formulations and verification in discrete event systems 

      Hadjicostis, Christoforos N.; Keroglou, C. (Institute of Electrical and Electronics Engineers Inc., 2014)
      In many emerging security applications, a property of a system, that may reveal important details about its behaviour, needs to be kept secret (opaque) to outside observers (intruders). Motivated by such applications, ...
    • Conference Object  

      Probabilistic failure diagnosis in finite state machines under unreliable observations 

      Athanasopoulou, E.; Li, N.; Hadjicostis, Christoforos N. (2006)
      In this paper we develop a probabilistic methodology for calculating the likelihood that an observed, possibly corrupted event sequence was generated by two (or more) candidate finite state machines (FSMs) (one of which ...