Advertisement

A verification environment for bigraphs

  • Gian PerroneEmail author
  • Søren Debois
  • Thomas T. Hildebrandt
SI: SAC-SVT'12

Abstract

We present the BigMC tool for bigraphical reactive systems that may be instantiated as a verification tool for any formalism or domain-specific modelling language encoded as a bigraphical reactive system. We introduce the syntax and use of BigMC, and exemplify its use with two small examples: a textbook “philosophers” example, and an example motivated by a ubiquitous computing application. We give a tractable heuristic with which to approximate interference between reaction rules, and prove this analysis to be safe. We provide a mechanism for state reachability checking of bigraphical reactive systems, based upon properties expressed in terms of matching, and describe a checking algorithm that makes use of the causation heuristic.

Keywords

Bigraphs Reactive systems Reachability analysis Domain-specific modelling languages 

References

  1. 1.
    Allan R (2010) Computing grand challenges. Technical Report DL-TR-2010-008, Science and Technology Facilities Council, JapanGoogle Scholar
  2. 2.
    Bacci G, Grohmann D, Miculan M (2009) DBtk: a toolkit for directed bigraphs. Algebra Coalgebra Comput Science, ItalyGoogle Scholar
  3. 3.
    Bundgaard M, Sassone V (2006) Typed polyadic pi-calculus in bigraphs. In: PPDP’06. ACM, New York. doi: 10.1145/1140335.1140336
  4. 4.
    Calder M, Sevegnani M (2012) Process algebra for event-driven runtime verification: a case study of wireless network management. In: Integrated formal methods. Springer, Berlin, pp 21–23Google Scholar
  5. 5.
    Elsborg E, Hildebrandt T, Sangiorgi D (2009) Type systems for bigraphs. In: TGC 2008. Lecture Notes in Computer Science, vol 5474. Springer, Berlin. doi: 10.1007/978-3-642-00945-78
  6. 6.
    Glenstrup A, Damgaard T, Birkedal L (2007) Højsgaard. An implementation of bigraph matching, Pennsylvania State University, PennsylvaniaGoogle Scholar
  7. 7.
    Godefroid P (1996) Partial-order methods for the verification of concurrent systems. Lecture Notes Computer Science, Springer, Berlin Google Scholar
  8. 8.
    Grohmann D, Miculan M (2007) Directed bigraphs. Electron Notes Theor Comput Sci 173:121–137CrossRefGoogle Scholar
  9. 9.
    Hoare C (1985) Communicating sequential processes. Prentice Hall International, Prentice HallGoogle Scholar
  10. 10.
    Højsgaard E (2012) Bigraphical languages and their simulation. PhD thesis, IT University of Copenhagen, CopenhagenGoogle Scholar
  11. 11.
    Jensen O (2006) Mobile processes in bigraphs. http://www.cl.cam.ac.uk/rm135/Jensen-monograph.pdf
  12. 12.
    Krivine J, Milner R, Troina A (2008) Stochastic bigraphs. Electron Notes Theor Comput Sci 218:73–96CrossRefGoogle Scholar
  13. 13.
    Leifer J, Milner R (2006) Transition systems, link graphs and Petri nets. J Math Struct Comput Sci 16(6):989–1047. doi: 10.1017/S0960129506005664 MathSciNetzbMATHCrossRefGoogle Scholar
  14. 14.
    Milner R (1980) A calculus of communicationsystems. LNCS, vol 92. Springer, BerlinGoogle Scholar
  15. 15.
    Milner R (2006) Pure bigraphs: structure and dynamics. Inf Comput 204(1):60–122. doi: 10.1016/j.ic.2005.07.003 MathSciNetzbMATHCrossRefGoogle Scholar
  16. 16.
    Milner R (2007) Local bigraphs and confluence: two conjectures: (extended abstract). In: EXPRESS 2006. Electronic Notes in Theoretical Computer Science, vol 175. Elsevier, Amsterdam. doi: 10.1016/j.entcs.2006.07.035
  17. 17.
    Milner R (2009) The space and motion of communicating agents. Cambridge University Press, CambridgeGoogle Scholar
  18. 18.
    Perrone G, Debois S, Hildebrandt T (2012) A model checker for bigraphs. In: ACM symposium on applied computing 2012—software verification and testing track. ACM, New YorkGoogle Scholar
  19. 19.
    Perrone G (2013) Domain-specific modelling languages in bigraphs. PhD thesis, IT University of Copenhagen, CopenhagenGoogle Scholar

Copyright information

© Springer-Verlag London 2013

Authors and Affiliations

  • Gian Perrone
    • 1
    Email author
  • Søren Debois
    • 1
  • Thomas T. Hildebrandt
    • 1
  1. 1.IT University of CopenhagenCopenhagenDenmark

Personalised recommendations