Passer à la navigation principale Passer à la recherche Passer au contenu principal

Strategy-based and knowledge-based models of information flow: Equivalence and decidability

  • Université de PARIS XII
  • Alexandru Ioan Cuza University
  • University of Bucharest

Résultats de recherche: Le chapitre dans un livre, un rapport, une anthologie ou une collection › Contribution à une conférence › Revue par des pairs

Résumé

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.

langue originaleAnglais
titreProceedings - 9th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing, SYNASC 2007
EditeurIEEE Computer Society
Pages33-40
Nombre de pages8
ISBN (imprimé)0769530788, 9780769530789
Les DOIs
étatPublié - 1 janv. 2007
Modification externeOui
Evénement9th International Symposium on Symbolic and Numeric lgorithms for Scientific Computing, SYNASC 2007 - Timisoara, Roumanie
Durée: 26 sept. 2007 → 29 sept. 2007

Série de publications

NomProceedings - 9th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing, SYNASC 2007

Une conférence

Une conférence9th International Symposium on Symbolic and Numeric lgorithms for Scientific Computing, SYNASC 2007
Pays/TerritoireRoumanie
La villeTimisoara
période26/09/07 → 29/09/07

Empreinte digitale

Examiner les sujets de recherche de « Strategy-based and knowledge-based models of information flow: Equivalence and decidability ». Ensemble, ils forment une empreinte digitale unique.

Contient cette citation