Executing bigraphical reactive systems

Gassara, Amal; Rodriguez, Ismael Bouassida; Jmaïel, Mohamed; Drira, Khalil

doi:10.1016/j.dam.2018.07.006

Cited by 8 publications

(14 citation statements)

References 13 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…There exist several good tools for bigraphs, e.g. BiGMTE [35]. We choose BigraphER as it is open-source, actively maintained, and provides a library of matching routines to build upon.…”

Section: Methodsmentioning

confidence: 99%

BigraphTalk: Verified Design of IoT Applications

Archibald

Shieh

et al. 2020

IEEE Internet Things J.

View full text Add to dashboard Cite

Graphical IoT device management platforms, such as IoTtalk, make it easy to describe interactions between IoT devices. Applications are defined by dragging-and-dropping devices and specifying how they are connected, e.g. a door sensor controlling a light. While this allows simple and rapid development, it remains possible to specify unwanted device configurations -such as using the same device to drive a motor up and down simultaneously, risking damaging the motor.We propose BigraphTalk, a verification framework for IoTtalk that utilizes formal techniques, based on bigraphs, to statically guarantee that unwanted configurations do not arise. In particular, we check for invalid connections between devices, as well as type errors, e.g. passing a float to a boolean switch. To the best of our knowledge, BigraphTalk is the first platform to support the graphical specification of correct-by-design IoT applications.BigraphTalk provides fully automated verification and feedback without end-users ever needing to specify a bigraph. This means any application, specifiable in IoTtalk, is guaranteed, so long as verification succeeds, not to violate the given configuration constraints when deployed; with no extra cost to the user.

show abstract

“…There exist several good tools for bigraphs, e.g. BiGMTE [35]. We choose BigraphER as it is open-source, actively maintained, and provides a library of matching routines to build upon.…”

Section: Methodsmentioning

confidence: 99%

BigraphTalk: Verified Design of IoT Applications

Archibald

Shieh

et al. 2020

IEEE Internet Things J.

View full text Add to dashboard Cite

show abstract

“…To evaluate the time complexity of our algorithm, we try to follow the "common practice" of the recent bigraphrelated literature [16,23] concerning experimental evaluation. The purpose is not to compare these works with our results (which is not possible nor fair due to the different problems treated) but rather to highlight the experimental setups on the time complexity analysis.…”

Section: Experimental Evaluation On the Time Complexitymentioning

confidence: 99%

A Canonical String Encoding for Pure Bigraphs

Grzelak

Aßmann

2021

SN COMPUT. SCI.

View full text Add to dashboard Cite

The bigraph theory, devised by Robin Milner, is a recent mathematical framework for concurrent processes. Its generality is able to subsume many existing process calculi, for example, CCS, CSP, and Petri nets. Further, it provides a uniform proof of bisimilarity, which is a congruence. We present the first canonical string encoding for pure and lean bigraphs by lifting the breadth-first canonical form of rooted unordered trees to a unique representation for bigraphs up to isomorphism (i.e., lean-support equivalence). The encoding’s applicability is limited to atomic alphabets. The time complexity is $$O(n^{2}k\, d \log {d})$$ O ( n 2 k d log d ) , where n is the number of places, d the degree of the place graph and k the maximum arity of a bigraph’s signature. We provide proof of the correctness of our method and also conduct experimental measurements to assess the complexity.

show abstract

“…Constraints (10), (11), (20), (21), (22) and (23) shape the flux in the subnetwork linking guest and host points. Specifically, (10) requires that each point from the guest receives at most one unit; this is needed when we want to be able to embed a redex where some points (e.g. upward inner names) would not match with an entity of the agent and (those points) would be deleted anyway when composing the resulting agent back.…”

Section: Directed Link Graphsmentioning

confidence: 99%

“…BRSs have been successfully applied to the formalization of a wide spectrum of domain-specific models, including context-aware systems, web-service orchestration languages [4,5,20,28]. BRSs are appealing because they provide a range of general results and tools, which can be readily instantiated with the specific model under scrutiny: libraries for bigraph manipulation (e.g., DBtk [1] and jLibBig [23,24]), simulation tools [10,19,21], graphical editors [9], model checkers [27], modular composition [26], stochastic extensions [18], etc.…”

Section: Introductionmentioning

confidence: 99%

Computing Embeddings of Directed Bigraphs

Chiapperini

Miculan

Peressotti

2020

Graph Transformation

View full text Add to dashboard Cite

Directed bigraphs are a meta-model which generalises Milner's bigraphs by taking into account the request flow between controls and names. A key problem about these bigraphs is that of bigraph embedding, i.e., finding the embeddings of a bigraph inside a larger one. We present an algorithm for computing embeddings of directed bigraphs, via a reduction to a constraint satisfaction problem. We prove soundness and completeness of this algorithm, and provide an implementation in jLibBig, a general Java library for manipulating bigraphical reactive systems, together with some experimental results.

show abstract

Executing bigraphical reactive systems

Cited by 8 publications

References 13 publications

BigraphTalk: Verified Design of IoT Applications

BigraphTalk: Verified Design of IoT Applications

A Canonical String Encoding for Pure Bigraphs

Computing Embeddings of Directed Bigraphs

Contact Info

Product

Resources

About