Observability Properties of Colored Graphs

@article{Chilenski2020ObservabilityPO,
  title={Observability Properties of Colored Graphs},
  author={M. Chilenski and G. Cybenko and I. Dekine and P. Kumar and G. Raz},
  journal={IEEE Transactions on Network Science and Engineering},
  year={2020},
  volume={7},
  pages={1687-1696}
}
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… Expand
3 Citations
Analytic Properties of Trackable Weak Models
  • 1
  • PDF
Graph Models in Tracking Behaviors for Cyber-Security
Identifying class of previously unseen programs using RF side channels

References

SHOWING 1-10 OF 30 REFERENCES
Observable graphs
  • 9
  • Highly Influential
  • PDF
Some Simplified NP-Complete Graph Problems
  • 2,040
The theory of trackability with applications to sensor networks
  • 34
  • PDF
Observability of discrete event dynamic systems
  • 300
  • PDF
Cryptographic Limitations on Learning Boolean Formulae and Finite Automata
  • 603
  • PDF
Notions of security and opacity in discrete event systems
  • 136
Opacity generalised to transition systems
  • 146
  • PDF
Graph Coloring Problems
  • 1,243
  • PDF
Control flow graph modifications for improved RF-based processor tracking performance
  • 5
  • PDF
...
1
2
3
...