Observability Properties of Colored Graphs

A colored graph is a directed graph in which nodes or edges have been assigned colors that are not necessarily unique. Observability problems in such graphs consider whether an agent observing the colors of edges or nodes traversed on a path in the graph can determine which node they are at currently or which nodes were visited earlier in the traversal. Previous research efforts have identified several different notions of observability as well as the associated properties of graphs for which those observability properties hold. This paper unifies the prior work into a common framework with several new results about relationships between those notions and associated graph properties. The new framework provides an intuitive way to reason about the attainable accuracy as a function of lag and time spent observing, and identifies simple modifications to improve the observability of a given graph. We show that one form of the graph modification problem is in NP-Complete. The intuition of the new framework is borne out with numerical experiments. This work has implications for problems that can be described in terms of an agent traversing a colored graph, including the reconstruction of hidden states in a hidden Markov model (HMM).

[1]  Tommy R. Jensen,et al.  Graph Coloring Problems , 1994 .

[2]  George Cybenko,et al.  Control flow graph modifications for improved RF-based processor tracking performance , 2018, Defense + Security.

[3]  Lawrence R. Rabiner,et al.  A tutorial on hidden Markov models and selected applications in speech recognition , 1989, Proc. IEEE.

[4]  Symbolic dynamics , 2008, Scholarpedia.

[5]  George Cybenko,et al.  How dynamic is the Web? , 2000, Comput. Networks.

[6]  Maciej Koutny,et al.  Opacity generalised to transition systems , 2005, International Journal of Information Security.

[7]  Yong Sheng,et al.  Distance measures for nonparametric weak process models , 2005, 2005 IEEE International Conference on Systems, Man and Cybernetics.

[8]  Guofei Jiang.  Weak process models for robust process detection , 2004, SPIE Defense + Commercial Sensing.

[9]  Anooshiravan Saboori,et al.  Verification and enforcement of state-based notions of opacity in discrete event systems , 2010 .

[10]  Vincent H. Berk,et al.  Process query systems for network security monitoring , 2005, SPIE Defense + Commercial Sensing.

[11]  Leslie G. Valiant,et al.  Cryptographic Limitations on Learning Boolean Formulae and Finite Automata , 1993, Machine Learning: From Theory to Applications.

[12]  David S. Johnson,et al.  Some Simplified NP-Complete Graph Problems , 1976, Theor. Comput. Sci..

[13]  D. de Werra,et al.  Graph Coloring Problems , 2013 .

[14]  Vincent D. Blondel,et al.  Observable graphs , 2007, Discret. Appl. Math..

[15]  George Cybenko,et al.  Large-scale Analogue Measurements and Analysis for Cyber-Security , 2018, Security Science and Technology.

[16]  A. Willsky,et al.  Observability of discrete event dynamic systems , 1990 .

[17]  George Cybenko,et al.  The theory of trackability and robustness for process detection , 2008 .

[18]  George Cybenko,et al.  Observation of changing information sources , 2000 .

[19]  Dominique Perrin,et al.  Symbolic dynamics , 2010, Handbook of Automata Theory.

[20]  George Cybenko,et al.  The theory of trackability with applications to sensor networks , 2008, TOSN.

[21]  Vincent H. Berk,et al.  Process query systems , 2007, Computer.

[22]  George Cybenko,et al.  Keeping up with the changing Web , 2000, Computer.

[23]  Christoforos N. Hadjicostis,et al.  Notions of security and opacity in discrete event systems , 2007, 2007 46th IEEE Conference on Decision and Control.