Skip to main content
Log in

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.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Fig. 1
Fig. 2
Fig. 3
Fig. 4
Fig. 5

References

  1. Allan R (2010) Computing grand challenges. Technical Report DL-TR-2010-008, Science and Technology Facilities Council, Japan

  2. Bacci G, Grohmann D, Miculan M (2009) DBtk: a toolkit for directed bigraphs. Algebra Coalgebra Comput Science, Italy

  3. Bundgaard M, Sassone V (2006) Typed polyadic pi-calculus in bigraphs. In: PPDP’06. ACM, New York. doi:10.1145/1140335.1140336

  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–23

  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. Glenstrup A, Damgaard T, Birkedal L (2007) Højsgaard. An implementation of bigraph matching, Pennsylvania State University, Pennsylvania

  7. Godefroid P (1996) Partial-order methods for the verification of concurrent systems. Lecture Notes Computer Science, Springer, Berlin

  8. Grohmann D, Miculan M (2007) Directed bigraphs. Electron Notes Theor Comput Sci 173:121–137

    Article  Google Scholar 

  9. Hoare C (1985) Communicating sequential processes. Prentice Hall International, Prentice Hall

  10. Højsgaard E (2012) Bigraphical languages and their simulation. PhD thesis, IT University of Copenhagen, Copenhagen

  11. Jensen O (2006) Mobile processes in bigraphs. http://www.cl.cam.ac.uk/rm135/Jensen-monograph.pdf

  12. Krivine J, Milner R, Troina A (2008) Stochastic bigraphs. Electron Notes Theor Comput Sci 218:73–96

    Article  Google Scholar 

  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

    Article  MathSciNet  MATH  Google Scholar 

  14. Milner R (1980) A calculus of communicationsystems. LNCS, vol 92. Springer, Berlin

  15. Milner R (2006) Pure bigraphs: structure and dynamics. Inf Comput 204(1):60–122. doi:10.1016/j.ic.2005.07.003

    Article  MathSciNet  MATH  Google Scholar 

  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. Milner R (2009) The space and motion of communicating agents. Cambridge University Press, Cambridge

  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 York

  19. Perrone G (2013) Domain-specific modelling languages in bigraphs. PhD thesis, IT University of Copenhagen, Copenhagen

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Gian Perrone.

Additional information

This work was funded in part by the Danish Research Agency (Grant No.: 2106-080046) and the IT University of Copenhagen (the Jingling Genies project).

Rights and permissions

Reprints and permissions

About this article

Cite this article

Perrone, G., Debois, S. & Hildebrandt, T.T. A verification environment for bigraphs. Innovations Syst Softw Eng 9, 95–104 (2013). https://doi.org/10.1007/s11334-013-0210-2

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s11334-013-0210-2

Keywords

Navigation