11 citations · 20 across the 9 of their papers we have counts for
9 papers · 1 filter
A Comprehensive History of CRL and mCRL2
Jan Friso Groote, Erik P. de Vink
This article gives a historical overview of the background, motivation and development of μCRL and its successor mCRL2, from the inception to the present. Both mCRL2 and μCRL are s…
Spatial Model Checking of Images via Minimised Models and Branching Bisimilarity
Vincenzo Ciancia, Jan Friso Groote, Diego Latella +2
Spatial models are of increasing interest in traditional computer science domains and beyond. Spatial minimisation procedures are crucial for efficient model checking of such model…
Weak Simplicial Bisimilarity for Polyhedral Models and SLCS_eta -- Extended Version
Nick Bezhanishvili, Vincenzo Ciancia, David Gabelaia +4
In the context of spatial logics and spatial model checking for polyhedral models -- mathematical basis for visualisations in continuous space -- we propose a weakening of simplici…
A Cancellation Law for Probabilistic Processes
Rob van Glabbeek, Jan Friso Groote, Erik de Vink
We show a cancellation property for probabilistic choice. If distributions mu + rho and nu + rho are branching probabilistic bisimilar, then distributions mu and nu are also branch…
On Bisimilarity for Quasi-discrete Closure Spaces
Vincenzo Ciancia, Diego Latella, Mieke Massink +1
Closure spaces, a generalisation of topological spaces, have shown to be a convenient theoretical framework for spatial model checking. The closure operator of closure spaces and q…
Lowerbounds for Bisimulation by Partition Refinement
Jan Friso Groote, Jan Martens, Erik. P. de Vink
We provide time lower bounds for sequential and parallel algorithms deciding bisimulation on labeled transition systems that use partition refinement. For sequential algorithms thi…
Bisimulation of Labelled State-to-Function Transition Systems Coalgebraically
Diego Latella, Mieke Massink, Erik P De Vink
Labeled state-to-function transition systems, FuTS for short, are characterized by transitions which relate states to functions of states over general semirings, equipped with a ri…
Rooted branching bisimulation as a congruence for probabilistic transition systems
Matias D. Lee, Erik P. de Vink
We propose a probabilistic transition system specification format, referred to as probabilistic RBB safe, for which rooted branching bisimulation is a congruence. The congruence th…
A Definition Scheme for Quantitative Bisimulation
Diego Latella, Mieke Massink, Erik de Vink
FuTS, state-to-function transition systems are generalizations of labeled transition systems and of familiar notions of quantitative semantical models as continuous-time Markov cha…