activity
20182026
most citedProbablistic Bigraphs

12 citations · 17 across the 7 of their papers we have counts for

collaborators

8 papers

cs.CY2026★ 1 cited

Responsible AI in criminal justice: LLMs in policing and risks to case progression

Muffy Calder, Marion Oswald, Elizabeth McClory-Tiarks +2

There is growing interest in the use of Large Language Models (LLMs) in policing, but there are potential risks. We have developed a practical approach to identifying risks, ground…

cs.LO2026

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…

cs.CY2025

Mapping the Probabilistic AI Ecosystem in Criminal Justice in England and Wales

Evdoxia Taka, Temitope Lawal, Muffy Calder +4

Commercial or in-house developments of probabilistic AI systems are introduced in policing and the wider criminal justice (CJ) system worldwide, often on a force-by-force basis. We…

cs.LO2024

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…

cs.PL2021★ 1 cited

Modelling and Verifying BDI Agents with Bigraphs

Blair Archibald, Muffy Calder, Michele Sevegnani +1

The Belief-Desire-Intention (BDI) architecture is a popular framework for rational agents; most verification approaches are based on reasoning about implementations of BDI programm…

cs.LO2021★ 12 cited

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…

cs.LO2020

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…

cs.LO2018★ 3 cited

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…