A verification environment for bigraphs

Authors:
Gian Perrone;Søren Debois;Thomas T. Hildebrandt
Affiliations:
IT University of Copenhagen, Copenhagen, Denmark;IT University of Copenhagen, Copenhagen, Denmark;IT University of Copenhagen, Copenhagen, Denmark
Venue:
Innovations in Systems and Software Engineering
Year:
2013

Citing 14
Cited 0

Communicating sequential processes

Communicating sequential processes
A Calculus of Communicating Systems

A Calculus of Communicating Systems
Partial-Order Methods for the Verification of Concurrent Systems: An Approach to the State-Explosion Problem

Partial-Order Methods for the Verification of Concurrent Systems: An Approach to the State-Explosion Problem
Typed polyadic pi-calculus in bigraphs

Proceedings of the 8th ACM SIGPLAN international conference on Principles and practice of declarative programming
Transition systems, link graphs and Petri nets

Mathematical Structures in Computer Science
Directed Bigraphs

Electronic Notes in Theoretical Computer Science (ENTCS)
Local Bigraphs and Confluence: Two Conjectures

Electronic Notes in Theoretical Computer Science (ENTCS)
Stochastic Bigraphs

Electronic Notes in Theoretical Computer Science (ENTCS)
Type Systems for Bigraphs

Trustworthy Global Computing
The Space and Motion of Communicating Agents

The Space and Motion of Communicating Agents
Pure bigraphs: Structure and dynamics

Information and Computation
DBtk: a toolkit for directed bigraphs

CALCO'09 Proceedings of the 3rd international conference on Algebra and coalgebra in computer science
A model checker for Bigraphs

Proceedings of the 27th Annual ACM Symposium on Applied Computing
Process algebra for event-driven runtime verification: a case study of wireless network management

IFM'12 Proceedings of the 9th international conference on Integrated Formal Methods

Quantified Score

Hi-index	0.00

Visualization

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.