"A simpler O(m log n) algorithm for branching bisimilarity on labelled ..."

David N. Jansen et al. (2019)

> Home

Details and statistics

DOI: —

access: open

type: Informal or Other Publication

metadata version: 2019-09-27

- view
  - electronic edition @ arxiv.org (open access)
- export record
  dblp key:
  - journals/corr/abs-1909-10824
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/corr/abs-1909-10824
David N. Jansen, Jan Friso Groote, Jeroen J. A. Keiren, Anton Wijs:
A simpler O(m log n) algorithm for branching bisimilarity on labelled transition systems. CoRR abs/1909.10824 (2019)

manage site settings

To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.