Secure Bisimulation for Interactive Systems

  • Guanjun LiuEmail author
  • Changjun Jiang
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 9530)


In real applications, many systems have the same functions but their securities are different due to different security policies. We find that different security policies can affect the interacting behavior of a system, which exactly is the reason why a good policy can strengthen the security. In other words, two interactive systems with different security policies are not of an equivalent behavior although their functions are identical. However, the classic (weak) bisimulation theory draws an opposite conclusion that their behaviors are equivalent. The notion of (weak) bisimulation is not suitable for these security-oriented interactive systems since it does not consider a security policy while the security policy can affect their interacting behaviors. This paper proposes the concept of secure bisimulation in order to solve the above problem. Based on secure bisimulation, we furthermore define a binary relation \(\ge _{SL}\) to compare the levels of different security policies. We prove that \(\ge _{SL}\) is a partial order but not a total one.


Interactive systems Labelled petri nets Labelled transition systems Bisimulation Security 



The authors would like to thank the three reviewers for their helpful comments. This paper is supported in part by the Alexander von Humboldt Foundation and in part by the National Natural Science Foundation of China (Grant Nos. 61202016, 61572360, and 91218301).


  1. 1.
    Autant, C., Schnoebelen, P.: Place bisimulations in Petri nets. In: Jensen, K. (ed.) ICALP 1992. LNCS, vol. 616, pp. 45–61. Springer, Heidelberg (1992)Google Scholar
  2. 2.
    Boudol, G., Castellani, I.: On the semantics of concurrency: partial orders and transition systems. In: Ehrig, H., Kowalski, R., Levi, G., Montanari, U. (eds.) TAPSOFT 1987. LNCS, vol. 249, pp. 123–137. Springer, Heidelberg (1987)Google Scholar
  3. 3.
    van Glabbeek, R.J., Vaandrager, F.: Petri net models for algebraic theories of concurrency. In: de Bakker, J.W., Nijman, A.J., Treleaven, P.C. (eds.) PARLE Parallel Architectures and Languages Europe. LNCS, vol. 259, pp. 224–242. Springer, Heidelberg (1987)CrossRefGoogle Scholar
  4. 4.
    Hopcroft, J.E., Ullman, J.D.: Introduction to Automata Theory. Languages and Computation. Addison-Wesley, Boston (1979)zbMATHGoogle Scholar
  5. 5.
    Milner, R.: Communication and Concurrency. Printice Hall, Upper Saddle River (1989)zbMATHGoogle Scholar
  6. 6.
    Milner, R.: Communicating and Mobile Systems: The \(\pi \)-Calculus. Cambridge University Press, Cambridge (1999)zbMATHGoogle Scholar
  7. 7.
    Nielsen, M., Thiagarajaa, P.S.: Degrees of non-determinism and concurrency: a Petri net view. In: Joseph, M., Shyamasundar, R. (eds.) Foundations of Software Technology and Theoretical Computer Science. LNCS, vol. 181, pp. 89–117. Springer, Heidelberg (1984)CrossRefGoogle Scholar
  8. 8.
    Nielsen, M., Winskel, G.: Bisimulations and Petri nets. Theor. Comput. Sci. 153, 211–244 (1996)CrossRefzbMATHGoogle Scholar
  9. 9.
    Pao, H.K., Fadlil, J., Lin, H.Y., Chen, K.T.: Trajectory analysis for user verification and recognition. Knowl.-Based Syst. 34, 81–90 (2012)CrossRefGoogle Scholar
  10. 10.
    Peterson, J.: Petri Net Theory and the Modeling of Systems. Prentice Hall, Upper Saddle River (1981)zbMATHGoogle Scholar
  11. 11.
    Reisig, W.: Understanding Petri Nets: Modeling Techniques, Analysis Methods, Case Studies. Springer, Heidelberg (2013)CrossRefzbMATHGoogle Scholar
  12. 12.
    Rúa, E.A., Castro, J.L.A.: Online signature verification based on generative models. IEEE Trans. Syst., Man, Cybern. B: Cybern. 42, 1231–1242 (2012)Google Scholar
  13. 13.
    Shen, C., Cai, Z., Guan, X., Du, Y., Maxion, R.A.: User authentication through mouse dynamics. IEEE Trans. Inf. Forensics Secur. 8, 16–30 (2013)CrossRefGoogle Scholar
  14. 14.
    Vogler, W.: Bisimulation and action refinement. In: Choffrut, C., Jantzen, M. (eds.) STACS 1991. LNCS, vol. 480, pp. 309–321. Springer, Heidelberg (1991)Google Scholar

Copyright information

© Springer International Publishing Switzerland 2015

Authors and Affiliations

  1. 1.Department of Computer ScienceTongji UniversityShanghaiChina
  2. 2.Key Lab of the Ministry of Education for Embedded Systems and Services ComputingTongji UniversityShanghaiChina

Personalised recommendations