ASSA-PBN 2.0: A Software Tool for Probabilistic Boolean Networks

  • Andrzej Mizera
  • Jun Pang
  • Qixia Yuan
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 9859)


We present a major new release of ASSA-PBN, a software tool for modelling, simulation, and analysis of probabilistic Boolean networks (PBNs). PBNs are a widely used computational framework for modelling biological systems. The steady-state dynamics of a PBN is of special interest and obtaining it poses a significant challenge due to the state space explosion problem which often arises in the case of large biological systems. In its previous version, ASSA-PBN applied efficient statistical methods to approximately compute steady-state probabilities of large PBNs. In this newly released version, ASSA-PBN not only speeds up the computation of steady-state probabilities with three different realisations of parallel computing, but also implements parameter estimation and techniques for in-depth analysis of PBNs, i.e., influence and sensitivity analysis of PBNs. In addition, a graphical user interface (GUI) is provided for the convenience of users.


Boolean Function Predictor Function System Biology Markup Language Probabilistic Boolean Network Perfect Simulation 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.



Qixia Yuan is supported by the National Research Fund, Luxembourg (grant 7814267). The authors also want to thank Gary Cornelius for his work on ASSA-PBN.


  1. 1.
    El Rabih, D., Pekergin, N.: Statistical model checking using perfect simulation. In: Liu, Z., Ravn, A.P. (eds.) ATVA 2009. LNCS, vol. 5799, pp. 120–134. Springer, Heidelberg (2009)CrossRefGoogle Scholar
  2. 2.
    Kennedy, J., Eberhart, R.: Particle swarm optimization. In: Proceedings of IEEE International Conference on Neural Networks, pp. 1942–1948 (1995)Google Scholar
  3. 3.
    Mizera, A., Pang, J., Yuan, Q.: ASSA-PBN: an approximate steady-state analyser of probabilistic Boolean networks. In: Finkbeiner, B., Pu, G., Zhang, L. (eds.) ATVA 2015. LNCS, vol. 9364, pp. 214–220. Springer, Heidelberg (2015). doi: 10.1007/978-3-319-24953-7_16 CrossRefGoogle Scholar
  4. 4.
    Mizera, A., Pang, J., Yuan, Q.: Reviving the two-state Markov chain approach (Technical report) (2015).
  5. 5.
    Mizera, A., Pang, J., Yuan, Q.: Fast simulation of probabilistic Boolean networks. In: Bartocci, E., et al. (eds.) Proceedings of 14th International Conference on Computational Methods in Systems Biology. LNCS, vol. 9859, pp. 216–231. Springer, Heidelberg (2016)Google Scholar
  6. 6.
    Mizera, A., Pang, J., Yuan, Q.: Parallel approximate steady-state analysis of large probabilistic Boolean networks. In: Proceedings of 31st ACM Symposium on Applied Computing, pp. 1–8. ACM Press (2016)Google Scholar
  7. 7.
    Moles, C.G., Mendes, P., Banga, J.R.: Parameter estimation in biochemical pathways: a comparison of global optimization methods. Genome Res. 13(11), 2467–2474 (2003)CrossRefGoogle Scholar
  8. 8.
    Qian, X., Dougherty, E.R.: On the long-run sensitivity of probabilistic Boolean networks. J. Theor. Biol. 257(4), 560–577 (2009)MathSciNetCrossRefGoogle Scholar
  9. 9.
    Shmulevich, I., Dougherty, E., Zhang, W.: From Boolean to probabilistic Boolean networks as models of genetic regulatory networks. Proc. IEEE 90(11), 1778–1792 (2002)CrossRefGoogle Scholar
  10. 10.
    Shmulevich, I., Dougherty, E.R.: Probabilistic Boolean Networks: The Modeling and Control of Gene Regulatory Networks. SIAM Press, New York (2010)CrossRefzbMATHGoogle Scholar
  11. 11.
    Trairatphisan, P., Mizera, A., Pang, J., Tantar, A.A., Sauter, T.: optPBN: an optimisation toolbox for probabilistic Boolean networks. PLOS ONE 9(7), e98001 (2014)CrossRefGoogle Scholar
  12. 12.
    Trairatphisan, P., Mizera, A., Pang, J., Tantar, A.A., Schneider, J., Sauter, T.: Recent development and biomedical applications of probabilistic Boolean networks. Cell Commun. Signaling 11, 46 (2013)CrossRefGoogle Scholar
  13. 13.
    Walker, A.: An efficient method for generating discrete random variables with general distributions. ACM Trans. Math. Softw. 3(3), 253–256 (1977)CrossRefzbMATHGoogle Scholar

Copyright information

© Springer International Publishing AG 2016

Authors and Affiliations

  1. 1.Faculty of Science, Technology and CommunicationUniversity of LuxembourgLuxembourg CityLuxembourg
  2. 2.Interdisciplinary Centre for Security, Reliability and TrustUniversity of LuxembourgLuxembourg CityLuxembourg

Personalised recommendations