12 citations · 17 across the 7 of their papers we have counts for
5 papers · 1 filter
Introducing The Maximum Common Bigraph Problem
Kyle Burns, Michele Sevegnani, Ciaran McCreesh +1
Bigraph reactive systems offer a powerful and flexible mathematical framework for modelling both spatial and non-spatial relationships between agents, with practical applications i…
Practical Modelling with Bigraphs
Blair Archibald, Muffy Calder, Michele Sevegnani
Bigraphs are a versatile modelling formalism that allows easy expression of placement and connectivity relations in a graphical format. System evolution is user defined as a set of…
Probablistic Bigraphs
Blair Archibald, Muffy Calder, Michele Sevegnani
Bigraphs are a universal computational modelling formalism for the spatial and temporal evolution of a system in which entities can be added and removed. We extend bigraphs to prob…
Analysing Spatial Properties on Neighbourhood Spaces
Sven Linker, Fabio Papacchini, Michele Sevegnani
We present a bisimulation relation for neighbourhood spaces, a generalisation of topological spaces. We show that this notion, path preserving bisimulation, preserves formulas of t…
Formalising Sensor Topologies for Target Counting
Sven Linker, Michele Sevegnani
We present a formal model developed to reason about topologies created by sensor ranges. This model is used to formalise the topological aspects of an existing counting algorithm t…