skip to main content
10.1145/2245276.2231985acmconferencesArticle/Chapter ViewAbstractPublication PagessacConference Proceedingsconference-collections
research-article

A model checker for Bigraphs

Published:26 March 2012Publication History

ABSTRACT

We present a model checking tool for Bigraphical Reactive Systems that may be instantiated as a model checker for any formalism or domain-specific modelling language encoded as a Bigraphical Reactive System. We describe the implementation of the tool, and how it can be used to verify correctness properties of some infinite-state models by applying a static analysis to reaction rules that permits the exclusion of some infinite branches of execution shown to always be free of violations. We give a proof of correctness for this method, and illustrate the usage of the tool with two examples --- a textbook implementation of the Dining Philosophers problem, and an example motivated by a ubiquitous computing application.

References

  1. RJ Allan. Computing grand challenges. Technical Report DL-TR-2010-008, Science and Technology Facilities Council, 2010.Google ScholarGoogle Scholar
  2. G. Bacci, D. Grohmann, and M. Miculan. DBtk: a toolkit for directed bigraphs. Algebra and Coalgebra in Computer Science, 2009. Google ScholarGoogle ScholarDigital LibraryDigital Library
  3. M. Bundgaard and V. Sassone. Typed polyadic pi-calculus in bigraphs. In PPDP'06. ACM, 2006. Google ScholarGoogle ScholarDigital LibraryDigital Library
  4. S. Chandra, P. Godefroid, and C. Palm. Software model checking in practice: an industrial case study. In ICSE 2002. IEEE, 2002. Google ScholarGoogle ScholarDigital LibraryDigital Library
  5. Cimatti, A., et al. Nusmv 2: An opensource tool for symbolic model checking. In Computer Aided Verification. Springer, 2002. Google ScholarGoogle ScholarDigital LibraryDigital Library
  6. E. M. Clarke, E. A. Emerson, and A. P. Sistla. Automatic verification of finite-state concurrent systems using temporal logic specifications. TOPLAS, 8(2), 1986. Google ScholarGoogle ScholarDigital LibraryDigital Library
  7. E. M. Clarke and B. H. Schlingloff. Model checking. In Handbook of automated reasoning. Elsevier, 2001. Google ScholarGoogle ScholarDigital LibraryDigital Library
  8. G. Conforti, D. Macedonio, and V. Sassone. Spatial logics for bigraphs. Automata, Languages and Programming, 2005. Google ScholarGoogle ScholarDigital LibraryDigital Library
  9. S. Debois. Computation in the informatic jungle. To appear. Draft available at http://www.itu.dk/people/debois/pubs/computation.pdf.Google ScholarGoogle Scholar
  10. E. Elsborg, T. Hildebrandt, and D. Sangiorgi. Type Systems for Bigraphs. In TGC 2008, volume 5474 of Lecture Notes in Computer Science. Springer-Verlag, 2009. Google ScholarGoogle ScholarDigital LibraryDigital Library
  11. A. J. Glenstrup, T. C. Damgaard, L. Birkedal, and E. Højsgaard. An implementation of bigraph matching. 2007.Google ScholarGoogle Scholar
  12. P. Godefroid. Partial-order methods for the verification of concurrent systems. Lecture notes in computer science, 1996. Google ScholarGoogle ScholarDigital LibraryDigital Library
  13. D. Grohmann and M. Miculan. Directed bigraphs. Electronic Notes in Theoretical Computer Science, 173, 2007. Google ScholarGoogle ScholarDigital LibraryDigital Library
  14. D. Grohmann and M. Miculan. Reactive systems over directed bigraphs. In CONCUR'07, volume 4703 of Lecture Notes in Computer Science. Springer-Verlag, 2007. Google ScholarGoogle ScholarDigital LibraryDigital Library
  15. C. A. R. Hoare. Communicating Sequential Processes. Prentice Hall International, 1985. Google ScholarGoogle ScholarDigital LibraryDigital Library
  16. G. J. Holzmann. The model checker SPIN. IEEE Transactions on Software Engineering, 23(5), 1997. Google ScholarGoogle ScholarDigital LibraryDigital Library
  17. O. H. Jensen. Mobile processes in bigraphs. Available at http://www.cl.cam.ac.uk/~rm135/Jensen-monograph.pdf, 2006.Google ScholarGoogle Scholar
  18. J. Leifer and R. Milner. Transition systems, link graphs and Petri nets. Journal of Mathematical Structures in Computer Science, 16(6), 2006. Google ScholarGoogle ScholarDigital LibraryDigital Library
  19. R. Milner. Pure bigraphs: Structure and dynamics. Information and Computation, 204, 2006. Google ScholarGoogle ScholarDigital LibraryDigital Library
  20. R. Milner. Local bigraphs and confluence: Two conjectures: (extended abstract). In EXPRESS 2006, volume 175 of Electronic Notes in Theoretical Computer Science. Elsevier, 2007. Google ScholarGoogle ScholarDigital LibraryDigital Library
  21. R. Milner. The space and motion of communicating agents. Cambridge University Press, 2009. Google ScholarGoogle ScholarDigital LibraryDigital Library

Index Terms

  1. A model checker for Bigraphs

      Recommendations

      Comments

      Login options

      Check if you have access through your login credentials or your institution to get full access on this article.

      Sign in
      • Published in

        cover image ACM Conferences
        SAC '12: Proceedings of the 27th Annual ACM Symposium on Applied Computing
        March 2012
        2179 pages
        ISBN:9781450308571
        DOI:10.1145/2245276
        • Conference Chairs:
        • Sascha Ossowski,
        • Paola Lecca

        Copyright © 2012 ACM

        Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

        Publisher

        Association for Computing Machinery

        New York, NY, United States

        Publication History

        • Published: 26 March 2012

        Permissions

        Request permissions about this article.

        Request Permissions

        Check for updates

        Qualifiers

        • research-article

        Acceptance Rates

        SAC '12 Paper Acceptance Rate270of1,056submissions,26%Overall Acceptance Rate1,650of6,669submissions,25%

      PDF Format

      View or Download as a PDF file.

      PDF

      eReader

      View online with eReader.

      eReader