Matching of Bigraphs

Birkedal, Lars; Damgaard, Troels C.; Glenstrup, Arne John; Milner, Robin

doi:10.1016/j.entcs.2007.04.013

Cited by 21 publications

(14 citation statements)

References 8 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…BigMC [15] is an explicit-state model checking tool for BRSs based on the BPL matching engine [3]. Currently, it does not support stochastic bigraphs nor bigraphs with sharing and can only check reachability properties.…”

Section: Introductionmentioning

confidence: 99%

BigraphER: Rewriting and Analysis Engine for Bigraphs

Sevegnani

Calder

2016

Lecture Notes in Computer Science

View full text Add to dashboard Cite

Abstract. BigraphER is a suite of open-source tools providing an efficient implementation of rewriting, simulation, and visualisation for bigraphs, a universal formalism for modelling interacting systems that evolve in time and space and first introduced by Milner. BigraphER consists of an OCaml library that provides programming interfaces for the manipulation of bigraphs, their constituents and reaction rules, and a command-line tool capable of simulating Bigraphical Reactive Systems (BRSs) and computing their transition systems. Other features are native support for both bigraphs and bigraphs with sharing, stochastic reaction rules, rule priorities, instantiation maps, parameterised controls, predicate checking, graphical output and integration with the probabilistic model checker PRISM.

show abstract

Section: Introductionmentioning

confidence: 99%

BigraphER: Rewriting and Analysis Engine for Bigraphs

Sevegnani

Calder

2016

Lecture Notes in Computer Science

View full text Add to dashboard Cite

show abstract

“…A detailed discussion of this system is out of the scope of this paper; we refer to [1] for explanation of a similar system. We just notice that we can prove that this matching inference system for directed bigraphs is sound and complete, that is, all valid matching sequences can be derived using these rules.…”

Section: Definition 1 (Matching Sentencementioning

confidence: 99%

“…So, we give an inductive characterization of a matching algorithm for directed bigraphs, along the lines of [1]. The main difference between the characterization presented in [1] is that we consider directed bigraphs (without binders). For this reason, both the structure of a matching sequence and many rules have to be changed and generalized.…”

Section: Matchingmentioning

confidence: 99%

See 1 more Smart Citation

DBtk: A Toolkit for Directed Bigraphs

Bacci

Grohmann

Miculan

2009

Algebra and Coalgebra in Computer Science

View full text Add to dashboard Cite

“…A SAT based algorithm for the matching problem [29], and bigraphs with sharing where the place graph can be a DAG are developed in [19]; a complete bigraphical framework is realized. BPLTool [30] enables reasoning on BRS systems with binding, and has an emphasis on implementation correctness with a matching system based on formally defined inference rules [31]. A similar approach has been followed in DBtk [32], a tool for reasoning on directed bigraphs, a form of bigraphs with directed edges.…”

Section: Brs For Modelling Cyber-physical Spacesmentioning

confidence: 99%

On the Interplay Between Cyber and Physical Spaces for Adaptive Security

Tsigkanos

Pasquale

Ghezzi

et al. 2018

IEEE Trans. Dependable and Secure Comput.

View full text Add to dashboard Cite

Abstract-Ubiquitous computing is resulting in a proliferation of cyber-physical systems that host or manage valuable physical and digital assets. These assets can be harmed by malicious agents through both cyber-enabled or physically-enabled attacks, particularly ones that exploit the often ignored interplay between the cyber and physical world. The explicit representation of spatial topology is key to supporting adaptive security policies. In this paper we explore the use of Bigraphical Reactive Systems to model the topology of cyber and physical spaces and their dynamics. We utilise such models to perform speculative threat analysis through model checking to reason about the consequences of the evolution of topological configurations on the satisfaction of security requirements. We further propose an automatic planning technique to identify an adaptation strategy enacting security policies at runtime to prevent, circumvent, or mitigate possible security requirements violations. We evaluate our approach using a case study concerned with countering insider threats in a building automation system.

show abstract

Matching of Bigraphs

Cited by 21 publications

References 8 publications

BigraphER: Rewriting and Analysis Engine for Bigraphs

BigraphER: Rewriting and Analysis Engine for Bigraphs

DBtk: A Toolkit for Directed Bigraphs

On the Interplay Between Cyber and Physical Spaces for Adaptive Security

Contact Info

Product

Resources

About