Browsing Τμήμα Ηλεκτρολόγων Μηχανικών και Μηχανικών Υπολογιστών / Department of Electrical and Computer Engineering by Title
Now showing items 2841-2860 of 2897
-
Article
-
Article
-
Conference Object
-
Article
-
Conference Object
Variational equalities of directed information and applications
(2013)In this paper we introduce two variational equalities of directed information, which are analogous to those of mutual information employed in the Blahut-Arimoto Algorithm (BAA). Subsequently, we introduce nonanticipative ...
-
Conference Object
-
Conference Object
-
Conference Object
-
Conference Object
Verification of AA-Diagnosability in Probabilistic Finite Automata is PSPACE-Hard
(2019)In this paper we consider the complexity of verifying the property of AA-diagnosability in probabilistic finite automata and establish that AA-diagnosability is, in general, a PSPACE-hard problem. In deterministic and ...
-
Article
Verification of detectability in Probabilistic Finite Automata
(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
(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 ...
-
Article
Verification of infinite-step opacity and complexity considerations
(2012)We describe and analyze the complexity of verifying the notion of infinite-step opacity in systems that are modeled as non-deterministic finite automata with partial observation on their transitions. Specifically, a system ...
-
Conference Object
Verification of initial-state opacity in security applications of DES
(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
(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 ...
-
Conference Object
Verification of K-step opacity and analysis of its complexity
(2009)In this paper, we analyze the verification of K-step opacity in discrete event systems that are modeled as (possibly non-deterministic) finite automata with partial observation on their transitions. A system is K-step ...
-
Article
Verification of K-step opacity and analysis of its complexity
(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 ...
-
Conference Object
-
Conference Object
-
Article
-
Conference Object