Probabilistic Analysis of Operational Security for Network Systems

  • Jolanta Koszelew


Survivability is the ability of system to continue operating in the presence of failures or malicious attacks [4]. We present an original method for performing probabilistic analysis of survivability of network systems. We can simulate failures and intrusion events in our method and then observe the effects of the injected events. Our model is based on Markov Decision Processes which are generalization of Markov Chains and provides the analysis of probabilistic measures for network systems, such us: probability that a service that has been issued will be finished or the expected time it takes a service to finish. We illustrate the idea of our technigues by a simply example.


Markov Decision Processes Computation Tree Logic Bayesian network 


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

5 References

  1. [1]
    Altman E., “Constraint Markov Decision Processes”, Champan and Hall, 1998Google Scholar
  2. [2]
    Clarke E. M., Grumberg O., Peled D, “Model checking”, MIT Press, 2000Google Scholar
  3. [3]
    Courcoubetis C., Yannakakis M., “The complexity of probabilistic verification”, Journal of ACM, 42(4), pp. 857–907, 1995MathSciNetCrossRefGoogle Scholar
  4. [4]
    Ellison R., Fisher D., Linger R., Longstaff T., Mead N., “Survivability network system analysis: A case study”, IEEE Software 16/4, pp. 307–317, 1999CrossRefGoogle Scholar
  5. [5]
    Farmer D., Spafford E., “The cops security checker system”, Proceedings Summer Usenix Conference, 1995Google Scholar
  6. [6]
    Ortalo R., Deswarte Y., Kaaniche M., “Experimenting with quantitative evaluation tools for monitoring operational security”, IEEE Transactions on Software Engineering, 25/5, pp. 633–650, 1999CrossRefGoogle Scholar
  7. [7]
    Koszelew J., “Some methods for verification of probabilistic programs interpreted in finite structures”, Computer information systems and industrial management applications: CISIM'03. WSFiZ, pp. 140–147, 2003Google Scholar
  8. [8]
    Pearl J., “Probabilistic Reasoning in Intelligent Systems: Networks of Plausible Inference”, Morgan Kaufmann, 1998Google Scholar
  9. [9]
    Pnueli A., “A temporal logic of concurrent programs”, Theoretical Comput. Sci., 13, pp. 45–60, 1980MathSciNetCrossRefGoogle Scholar

Copyright information

© Springer Science+Business Media, Inc. 2005

Authors and Affiliations

  • Jolanta Koszelew
    • 1
    • 2
  1. 1.Faculty of EngineeringThe University of Finance and Management in BialystokBialystok
  2. 2.Faculty of Computer ScienceBialystok Technical UniversityBialystok

Personalised recommendations