Affiliations: [a] School of Informatics, University of Edinburgh, UK. Jane.Hillston@ed.ac.uk | [b] Dept. of Environmental Sciences, Informatics and Statistics, Univiversità Ca’ Foscari Venezia, Italy. marin@unive.it | [c] Dept. of Mathematics, Informatics, and Physics, Università di Udine, Italy. carla.piazza@uniud.it | [d] Dept. of Environmental Sciences, Informatics and Statistics, Università Ca’ Foscari Venezia, Italy. sabina.rossi@unive.it
Correspondence:
[*]
Address for correspondence: Dept. of Environmental Sciences, Informatics and Statistics (DAIS), Università Ca’ Foscari Venezia, Via Torino 155, 30172 Mestre (VE), Italy
Abstract: In this paper, we study an information flow security property for systems specified as terms of a quantitative Markovian process algebra, namely the Performance Evaluation Process Algebra (PEPA). We propose a quantitative extension of the Non-Interference property used to secure systems from the functional point view by assuming that the observers are able to measure also the timing properties of the system, e.g., the response time of certain actions or its throughput. We introduce the notion of Persistent Stochastic Non-Interference (PSNI) based on the idea that every state reachable by a process satisfies a basic Stochastic Non-Interference (SNI) property. The structural operational semantics of PEPA allows us to give two characterizations of PSNI: one based on a bisimulation-like equivalence relation inducing a lumping on the underlying Markov chain, and another one based on unwinding conditions which demand properties of individual actions. These two different characterizations naturally lead to efficient methods for the verification and construction of secure systems. A decision algorithm for PSNI is presented and an application of PSNI to a queueing system is discussed.
Keywords: Process Algebra, Non-Interference, Stochastic models
