Browsing by Subject "State estimation"

Now showing items 21-29 of 29

    • Conference Object  

      Reconstruction of transition firing sequences based on asynchronous observations of place token changes 

      Hadjicostis, Christoforos N.; Li, L. (2007)
      This paper proposes a methodology for reconstructing the possible transition firing sequences in a given Petri net based on asynchronous observations of token changes at different places of the Petri net. The observed ...
    • Conference Object  

      Robust modification of a new class of adaptive controllers 

      Zhang, Youping; Ioannou, Petros A. (1995)
      Recently, a new class of adaptive control schemes, motivated from nonlinear systems theory, has been proposed for minimum phase linear time invariant plants. Under certain assumptions on the plant transfer function, these ...
    • Conference Object  

      State estimation in discrete event systems modeled by labeled Petri Nets 

      Ru, Y.; Hadjicostis, Christoforos N. (2006)
      In this paper, we address the problem of state estimation in Discrete Event Systems (DES) modeled by labeled Petri nets that may have nondeterministic transitions (i.e., transitions that share the same label) or unobservable ...
    • Article  

      Stochastic nonlinear minimax filtering in continuous-time 

      Charalambous, Charalambos D.; Djouadi, S. M. (2001)
      This paper discusses nonlinear stochastic minimax games in which the minimizing player is the state estimate while the maximizing players are square-integrable stochastic disturbances. A pathwise optimization method is ...
    • Article  

      Verification of detectability in Probabilistic Finite Automata 

      Keroglou, C.; Hadjicostis, Christoforos N. (2017)
      In this paper we analyze state estimation in stochastic discrete event systems (SDES) that can be modeled as probabilistic finite automata (PFAs). For a given PFA, we obtain the necessary and sufficient conditions that ...
    • Conference Object  

      Verification of infinite-step opacity and analysis of its complexity 

      Saboori, A.; Hadjicostis, Christoforos N. (2009)
      In this paper, we formulate, analyze, and devise methodologies to verify the notion of infinite-step opacity in discrete event systems that are modeled as (possibly non-deterministic) finite automata with partial observation ...
    • Conference Object  

      Verification of initial-state opacity in security applications of DES 

      Saboori, A.; Hadjicostis, Christoforos N. (2008)
      Motivated by security applications where the initial state of a system needs to be kept secret (opaque) to outside observers (intruders), we formulate, analyze and verify the notion of initial-state opacity in discrete ...
    • Article  

      Verification of initial-state opacity in security applications of discrete event systems 

      Saboori, A.; Hadjicostis, Christoforos N. (2013)
      In this paper, we formulate and analyze methodologies for verifying the notion of initial-state opacity in discrete event systems that are modeled as non-deterministic finite automata with partial observation on their ...
    • Article  

      Verification of K-step opacity and analysis of its complexity 

      Saboori, A.; Hadjicostis, Christoforos N. (2011)
      Motivated by security and privacy considerations in a variety of applications of discrete event systems, we describe and analyze the computational complexity required for verifying the notion of K-step opacity for systems ...