@InProceedings{wimann_et_al:LIPIcs.CONCUR.2021.32,
  author =	{Wi{\ss}mann, Thorsten and Milius, Stefan and Schr\"{o}der, Lutz},
  title =	{{Explaining Behavioural Inequivalence Generically in Quasilinear Time}},
  booktitle =	{32nd International Conference on Concurrency Theory (CONCUR 2021)},
  pages =	{32:1--32:18},
  series =	{Leibniz International Proceedings in Informatics (LIPIcs)},
  ISBN =	{978-3-95977-203-7},
  ISSN =	{1868-8969},
  year =	{2021},
  volume =	{203},
  editor =	{Haddad, Serge and Varacca, Daniele},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CONCUR.2021.32},
  URN =		{urn:nbn:de:0030-drops-144094},
  doi =		{10.4230/LIPIcs.CONCUR.2021.32},
  annote =	{Keywords: bisimulation, partition refinement, modal logic, distinguishing formulae, coalgebra}
}