TY - GEN
T1 - Strategy-based and knowledge-based models of information flow
T2 - 9th International Symposium on Symbolic and Numeric lgorithms for Scientific Computing, SYNASC 2007
AU - Dima, Cǎtǎlin
AU - Enea, Constantin
AU - Sofronia, Alexandru
AU - Gramatovici, Radu
PY - 2007/1/1
Y1 - 2007/1/1
N2 - We show that two notions of information flow, one which is strategy-based and the other knowledge-based, are equivalent. The first notion models the possibilities that a high-level user has to send information to the low-level user by distinctly observable runs, whereas the second notion models information leak as variations in the knowledge of the low-level user during his observation of the system behavior. We also give an algorithm for deciding whether a finite-state system has no information flow in our setting, by reducing the problem to a reachability problem in finite automata. copy; 2008 IEEE.
AB - We show that two notions of information flow, one which is strategy-based and the other knowledge-based, are equivalent. The first notion models the possibilities that a high-level user has to send information to the low-level user by distinctly observable runs, whereas the second notion models information leak as variations in the knowledge of the low-level user during his observation of the system behavior. We also give an algorithm for deciding whether a finite-state system has no information flow in our setting, by reducing the problem to a reachability problem in finite automata. copy; 2008 IEEE.
U2 - 10.1109/SYNASC.2007.67
DO - 10.1109/SYNASC.2007.67
M3 - Conference contribution
AN - SCOPUS:48049119048
SN - 0769530788
SN - 9780769530789
T3 - Proceedings - 9th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing, SYNASC 2007
SP - 33
EP - 40
BT - Proceedings - 9th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing, SYNASC 2007
PB - IEEE Computer Society
Y2 - 26 September 2007 through 29 September 2007
ER -