Spatial Logics for Bigraphs

Conforti, Giovanni; Macedonio, Damiano; Sassone, Vladimiro

doi:10.1007/11523468_62

Cited by 34 publications

(14 citation statements)

References 14 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…The other option involves extending the notion of reaction rule to include what may be called conditional reaction rules, having the form (ϕ, R, R , ρ), where ϕ is a BiLog [CMS05] predicate expressing a condition imposed upon the bigraphical context in which left-hand side R occurs. Also with this option, less controls are required and instantaneous reaction rules can be avoided.…”

Section: Discussionmentioning

confidence: 99%

Modelling IEEE 802.11 CSMA/CA RTS/CTS with stochastic bigraphs with sharing

Calder

Sevegnani

2014

Form. Asp. Comput.

View full text Add to dashboard Cite

Abstract. Stochastic bigraphical reactive systems (SBRS) is a recent formalism for modelling systems that evolve in time and space. However, the underlying spatial model is based on sets of trees and thus cannot represent spatial locations that are shared among several entities in a simple or intuitive way. We adopt an extension of the formalism, SBRS with sharing, in which the topology is modelled by a directed acyclic graph structure. We give an overview of SBRS with sharing, we extend it with rule priorities, and then use it to develop a model of the 802.11 CSMA/CA RTS/CTS protocol with exponential backoff, for an arbitrary network topology with possibly overlapping signals. The model uses sharing to model overlapping connectedness areas, instantaneous prioritised rules for deterministic computations, and stochastic rules with exponential reaction rates to model constant and uniformly distributed timeouts and constant transmission times. Equivalence classes of model states modulo instantaneous reactions yield states in a CTMC that can be analysed using the model checker PRISM. We illustrate the model on a simple example wireless network with three overlapping signals and we present some example quantitative properties.

show abstract

Section: Discussionmentioning

confidence: 99%

Modelling IEEE 802.11 CSMA/CA RTS/CTS with stochastic bigraphs with sharing

Calder

Sevegnani

2014

Form. Asp. Comput.

View full text Add to dashboard Cite

show abstract

“…The patterns we use in our analysis are given in Tables VI and VII In order to express properties of bigraphical reaction rules, we introduce the notation P lhs and P rhs to indicate that pattern P refers to the left-hand side and the righthand side of a reaction rule, respectively. This lightweight notation is sufficient for our analysis, based on bigraph matching as defined in [Sevegnani and Calder 2015], though we note that more extensive logical properties of bigraphs can be expressed in the full-blown spatial logic BiLog [Conforti et al 2005]. …”

Section: Bigraphical Patternsmentioning

confidence: 99%

On Lions, Impala, and Bigraphs

Benford

Calder

Rodden

et al. 2016

ACM Trans. Comput.-Hum. Interact.

View full text Add to dashboard Cite

While HCI has a long tradition of formally modelling task-based interactions with graphical user interfaces, there has been less progress in modelling emerging ubiquitous computing systems due in large part to their highly contextual nature and dependence on unreliable sensing systems. We present an exploration of modelling an example ubiquitous system, the Savannah game, using the mathematical formalism of bigraphs, which are based on a universal process algebra that encapsulates both dynamic and spatial behaviour of autonomous agents that interact and move among each other, or within each other. We establish a modelling approach based on four perspectives on ubiquitous systems -Computational, Physical, Human and Technology -and explore how these interact with one another. We show how our model explains observed inconsistencies in user trials of Savannah, and then how formal analysis reveals an incompleteness in design and guides extensions of the model and/or possible system re-design to resolve this.

show abstract

“…by requiring or forbidding specific occurrences [1], type systems [7] and modal logics [5]. The same tools and techniques are used to decorate a BRS MAS specification with (global) properties and desiderata.…”

Section: From Brs To Masmentioning

confidence: 99%

“…In particular, "spatiality" and "temporality" are used to characterize the states and transitions of the given BRS respectively. This is achieved by combining a temporal logic such as CTL (computational tree logic) on top of BiLog, a spatial logic for bigraphs [5]: BiLog formulae are seen as the atomic predicates of CTL. Although more complex combinations are possible (even spatial-temporal logics precisely designed for BRS), this rather simple stratification already yields a great expressive power.…”

Section: Structural Properties and Desideratamentioning

confidence: 99%