Bisimulation-based information flow properties were introduced by Focardi and Gorrieri [1] as a way of specifying security properties for transition system models. These properties were shown to be decidable for finite-state systems. In this paper, we study the problem of verifying these properties for some well-known classes of infinite state systems. We show that all the properties are undecidable for each of these classes of systems. © 2012 Springer-Verlag.
CITATION STYLE
D’Souza, D., & Raghavendra, K. R. (2012). Model-checking bisimulation-based information flow properties for infinite state systems. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 7459 LNCS, pp. 591–608). https://doi.org/10.1007/978-3-642-33167-1_34
Mendeley helps you to discover research relevant for your work.