Content available in repository
Content available in repository
Fingerprint
Dive into the research topics where David N. Jansen is active. These topic labels come from the works of this person. Together they form a unique fingerprint.
- 1 Similar Profiles
-
A near-linear-time algorithm for weak bisimilarity on Markov chains.
Jansen, D., Groote, J. F., Timmers, F. & Yang, P., 1 Aug 2020, 31st International Conference on Concurrency Theory (CONCUR2020). Konnov, I. & Kovacs, L. (eds.). Dagstuhl: Schloss Dagstuhl - Leibniz-Zentrum für Informatik, p. 8:1-8:20 20 p. 8. (Leibniz International Proceedings in Informatics, LIPIcs; vol. 171).Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › Academic › peer-review
Open Access4 Citations (Scopus) -
An O(m log n) algorithm for branching bisimilarity on labelled transition systems
Jansen, D. N., Groote, J. F., Keiren, J. J. A. & Wijs, A., 2020, Tools and Algorithms for the Construction and Analysis of Systems- 26th International Conference, TACAS 2020, held as part of the European Joint Conferences on Theory and Practice of Software, ETAPS 2020, Proceedings, Part II. Biere, A. & Parker, D. (eds.). Springer, p. 3-20 18 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 12079 LNCS).Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › Academic › peer-review
Open Access16 Citations (Scopus) -
A simpler O(m log n) algorithm for branching bisimilarity on labelled transition systems
Jansen, D. N., Groote, J. F., Keiren, J. J. A. & Wijs, A., 2019, In: CoRR. abs/1909.10824Research output: Contribution to journal › Article › Academic
-
A simpler O(m log n) algorithm for branching bisimilarity on labelled transition systems
Jansen, D. N., Groote, J. F., Keiren, J. J. A. & Wijs, A., 24 Sept 2019, In: arXiv. 2019, 27 p., 1909.10824.Research output: Contribution to journal › Article › Academic
Open AccessFile41 Downloads (Pure) -
A simpler O (m log n) algorithm for branching bisimilarity on labelled transition systems
Jansen, D. N., Groote, J. F., Keiren, J. J. A. & Wijs, A., 2019, Eindhoven: Technische Universiteit Eindhoven. 27 p. (Computer Science Reports; vol. 19-03)Research output: Book/Report › Report › Professional
Open AccessFile145 Downloads (Pure)
Datasets
-
An O(m log n) Algorithm for Branching Bisimilarity on Labelled Transition Systems
Wijs, A. (Creator), Keiren, J. J. A. (Creator), Groote, J. F. (Creator) & Jansen, D. N. (Creator), Figshare, 20 Feb 2020
DOI: 10.6084/m9.figshare.11876688
Dataset