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.
- RJ Allan. Computing grand challenges. Technical Report DL-TR-2010-008, Science and Technology Facilities Council, 2010.Google Scholar
- G. Bacci, D. Grohmann, and M. Miculan. DBtk: a toolkit for directed bigraphs. Algebra and Coalgebra in Computer Science, 2009. Google ScholarDigital Library
- M. Bundgaard and V. Sassone. Typed polyadic pi-calculus in bigraphs. In PPDP'06. ACM, 2006. Google ScholarDigital Library
- S. Chandra, P. Godefroid, and C. Palm. Software model checking in practice: an industrial case study. In ICSE 2002. IEEE, 2002. Google ScholarDigital Library
- Cimatti, A., et al. Nusmv 2: An opensource tool for symbolic model checking. In Computer Aided Verification. Springer, 2002. Google ScholarDigital Library
- 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 ScholarDigital Library
- E. M. Clarke and B. H. Schlingloff. Model checking. In Handbook of automated reasoning. Elsevier, 2001. Google ScholarDigital Library
- G. Conforti, D. Macedonio, and V. Sassone. Spatial logics for bigraphs. Automata, Languages and Programming, 2005. Google ScholarDigital Library
- S. Debois. Computation in the informatic jungle. To appear. Draft available at http://www.itu.dk/people/debois/pubs/computation.pdf.Google Scholar
- 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 ScholarDigital Library
- A. J. Glenstrup, T. C. Damgaard, L. Birkedal, and E. Højsgaard. An implementation of bigraph matching. 2007.Google Scholar
- P. Godefroid. Partial-order methods for the verification of concurrent systems. Lecture notes in computer science, 1996. Google ScholarDigital Library
- D. Grohmann and M. Miculan. Directed bigraphs. Electronic Notes in Theoretical Computer Science, 173, 2007. Google ScholarDigital Library
- 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 ScholarDigital Library
- C. A. R. Hoare. Communicating Sequential Processes. Prentice Hall International, 1985. Google ScholarDigital Library
- G. J. Holzmann. The model checker SPIN. IEEE Transactions on Software Engineering, 23(5), 1997. Google ScholarDigital Library
- O. H. Jensen. Mobile processes in bigraphs. Available at http://www.cl.cam.ac.uk/~rm135/Jensen-monograph.pdf, 2006.Google Scholar
- J. Leifer and R. Milner. Transition systems, link graphs and Petri nets. Journal of Mathematical Structures in Computer Science, 16(6), 2006. Google ScholarDigital Library
- R. Milner. Pure bigraphs: Structure and dynamics. Information and Computation, 204, 2006. Google ScholarDigital Library
- 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 ScholarDigital Library
- R. Milner. The space and motion of communicating agents. Cambridge University Press, 2009. Google ScholarDigital Library
Index Terms
- A model checker for Bigraphs
Recommendations
Modeling and Verification of Reactive Systems using Rebeca
Actor-based modeling has been successfully applied to the representation of concurrent and distributed systems. Besides having an appropriate and efficient way for modeling these systems, one needs a formal verification approach for ensuring their ...
Modeling and Verification of Reactive Systems using Rebeca
Actor-based modeling has been successfully applied to the representation of concurrent and distributed systems. Besides having an appropriate and efficient way for modeling these systems, one needs a formal verification approach for ensuring their ...
A verification environment for bigraphs
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 ...
Comments