A simpler O(m log n) algorithm for branching bisimilarity on labelled transition systems

Onderzoeksoutput: Bijdrage aan tijdschriftTijdschriftartikelAcademic

Originele taal-2Engels
TijdschriftCoRR
Volumeabs/1909.10824
StatusGepubliceerd - 2019

Bibliografische nota

DBLP License: DBLP's bibliographic metadata records provided through http://dblp.org/ are distributed under a Creative Commons CC0 1.0 Universal Public Domain Dedication. Although the bibliographic metadata records are provided consistent with CC0 1.0 Dedication, the content described by the metadata records is not. Content may be subject to copyright, rights of privacy, rights of publicity and other restrictions.

Citeer dit