7 citations · 12 across the 11 of their papers we have counts for
7 papers · 1 filter
The Only Distributive Law Over the Powerset Monad Is the One You Know
Sergey Goncharov, Dirk Hofmann, Pedro Nora +2
Distributive laws of set functors over the powerset monad (also known as Kleisli laws for the powerset monad) are well-known to be in one-to-one correspondence with extensions of s…
Computing Distinguishing Formulae for Threshold-Based Behavioural Distances
Jonas Forster, Lutz Schröder, Paul Wild +2
Behavioural distances generally offer more fine-grained means of comparing quantitative systems than two-valued behavioural equivalences. They often relate to quantitative modaliti…
Relators and Notions of Simulation Revisited
Sergey Goncharov, Dirk Hofmann, Pedro Nora +2
Simulations and bisimulations are ubiquitous in the study of concurrent systems and modal logics of various types. Besides classical relational transition systems, relevant system…
Relational Connectors and Heterogeneous Bisimulations
Pedro Nora, Jurriaan Rot, Lutz Schröder +1
While behavioural equivalences among systems of the same type, such as Park/Milner bisimilarity of labelled transition systems, are an established notion, a systematic treatment of…
Identity-Preserving Lax Extensions and Where to Find Them
Sergey Goncharov, Dirk Hofmaan, Pedro Nora +2
Generic notions of bisimulation for various types of systems (nondeterministic, probabilistic, weighted etc.) rely on identity-preserving (normal) lax extensions of the functor enc…
Quantitative Hennessy-Milner Theorems via Notions of Density
Jonas Forster, Sergey Goncharov, Dirk Hofmann +3
The classical Hennessy-Milner theorem is an important tool in the analysis of concurrent processes; it guarantees that any two non-bisimilar states in finitely branching labelled t…