Advertisement

BigraphER: Rewriting and Analysis Engine for Bigraphs

  • Michele SevegnaniEmail author
  • Muffy Calder
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 9780)

Abstract

BigraphER is a suite of open-source tools providing an efficient implementation of rewriting, simulation, and visualisation for bigraphs, a universal formalism for modelling interacting systems that evolve in time and space and first introduced by Milner. BigraphER consists of an OCaml library that provides programming interfaces for the manipulation of bigraphs, their constituents and reaction rules, and a command-line tool capable of simulating Bigraphical Reactive Systems (BRSs) and computing their transition systems. Other features are native support for both bigraphs and bigraphs with sharing, stochastic reaction rules, rule priorities, instantiation maps, parameterised controls, predicate checking, graphical output and integration with the probabilistic model checker PRISM.

Notes

Acknowledgments

This work was supported by EPSRC project Homework (EP/F064225/1) and an EPSRC Doctoral Prize Research Fellowship.

References

  1. 1.
    Bacci, G., Grohmann, D., Miculan, M.: \(\sf DBtk\): a toolkit for directed bigraphs. In: Kurz, A., Lenisa, M., Tarlecki, A. (eds.) CALCO 2009. LNCS, vol. 5728, pp. 413–422. Springer, Heidelberg (2009)CrossRefGoogle Scholar
  2. 2.
    Benford, S., Rodden, T., Calder, M., Sevegnani, M.: On lions, impala, and bigraphs: modelling interactions in physical/virtual spaces. ACM Trans. Comput. Hum. Interact. (2016, in press)Google Scholar
  3. 3.
    Birkedal, L., Damgaard, T.C., Glenstrup, A.J., Milner, R.: Matching of bigraphs. ENTCS 175(4), 3–19 (2007)zbMATHGoogle Scholar
  4. 4.
    Boucebsi, R., Belala, F.: Towards a channels allocation scheme model for WMNs based on SBRS with sharing. In: Proceedings of MeMo 2015, p. 5 (2015)Google Scholar
  5. 5.
    Calder, M., Koliousis, A., Sevegnani, M., Sventek, J.: Real-time verification of wireless home networks using bigraphs with sharing. Sci. Comput. Program. 80(Pt. B), 288–310 (2014)CrossRefGoogle Scholar
  6. 6.
    Calder, M., Sevegnani, M.: Modelling IEEE 802.11 CSMA/CA RTS/CTS with stochastic bigraphs with sharing. Formal Aspects Comput. Sci. 26, 537–561 (2014)MathSciNetCrossRefGoogle Scholar
  7. 7.
    Eén, N., Sörensson, N.: An extensible SAT-solver. In: Giunchiglia, E., Tacchella, A. (eds.) SAT 2003. LNCS, vol. 2919, pp. 502–518. Springer, Heidelberg (2004)CrossRefGoogle Scholar
  8. 8.
    Ellson, J., Gansner, E.R., Koutsofios, L., North, S.C., Woodhull, G.: Graphviz - open source graph drawing tools. In: Mutzel, P., Jünger, M., Leipert, S. (eds.) GD 2001. LNCS, vol. 2265, p. 483. Springer, Heidelberg (2002)CrossRefGoogle Scholar
  9. 9.
    Faithfull, A., Perrone, G., Hildebrandt, T.T.: Big Red: a development environment for bigraphs. In: Proceedings of GCM 2012, vol. 61 (2013)Google Scholar
  10. 10.
    Gillespie, D.T.: Exact stochastic simulation of coupled chemical reactions. J. Phys. Chem. 81(25), 2340–2361 (1977)CrossRefGoogle Scholar
  11. 11.
    Krivine, J., Milner, R., Troina, A.: Stochastic bigraphs. ENTCS 218, 73–96 (2008)zbMATHGoogle Scholar
  12. 12.
    Kwiatkowska, M., Norman, G., Parker, D.: PRISM 4.0: verification of probabilistic real-time systems. In: Gopalakrishnan, G., Qadeer, S. (eds.) CAV 2011. LNCS, vol. 6806, pp. 585–591. Springer, Heidelberg (2011)CrossRefGoogle Scholar
  13. 13.
    Milner, R.: The Space and Motion of Communicating Agents. Cambridge University Press, Cambridge (2009)CrossRefzbMATHGoogle Scholar
  14. 14.
    Pereira, E., Kirsch, C., Sengupta, R., Sousa, J.: BigActors - a model for structure-aware computation. In: 4th International Conference on Cyber-Physical Systems, pp. 199–208. ACM/IEEE (2013)Google Scholar
  15. 15.
    Perrone, G., Debois, S., Hildebrandt, T.T.: A model checker for bigraphs. In: Proceedings of SAC 2012, pp. 1320–1325. ACM (2012)Google Scholar
  16. 16.
    Sevegnani, M., Calder, M.: Bigraphs with sharing. Theoret. Comput. Sci. 577, 43–73 (2015)MathSciNetCrossRefzbMATHGoogle Scholar
  17. 17.
    Tseitin, G.S.: On the complexity of derivation in propositional calculus. Stud. Constr. Math. Math. Logic 2(115–125), 10–13 (1968)Google Scholar
  18. 18.
    Tsigkanos, C., Pasquale, L., Ghezzi, C., Nuseibeh, B.: Ariadne: topology aware adaptive security for cyber-physical systems. In: ICSE 2015, vol. 2, pp. 729–732 (2015)Google Scholar
  19. 19.
    Yu, L., Tsai, W.T., Wei, X., Gao, J., Hildebrandt, T., Guo, X.Q.: Modeling and analysis of mobile cloud computing based on bigraph theory. MobileCloud 2014, 67–76 (2014)Google Scholar

Copyright information

© Springer International Publishing Switzerland 2016

Authors and Affiliations

  1. 1.School of Computing ScienceUniversity of GlasgowGlasgowUK

Personalised recommendations