David N. Jansen

David N. Jansen is a University Researcher at Eindhoven University of Technology (TU/e) within the Faculty of Mathematics and Computer Science, specializing in the Formal System Analysis research group. His work focuses on theoretical computer science with emphasis on algorithmic efficiency for system verification, maintaining an active research profile through 2020 and media engagements through 2023. Contact is available via d.n.jansen@tue.nl.

Research Interests: Jansen's core expertise lies in formal methods and concurrency theory, specifically developing time-optimized algorithms for bisimulation relations. His research targets model checking, equivalence relations in transition systems, and computational complexity analysis for Markov chains and probabilistic systems, with fingerprint data confirming 100% activity in transition system analysis.

Publication Trends: Recent outputs (2019-2020) showcase consistent breakthroughs in bisimulation algorithms. Key contributions include reducing branching bisimilarity computation to O(m log n) complexity across multiple venues (TACAS, CONCUR), with significant citation impact (17 Scopus citations for TACAS 2020 work). All publications exhibit deep integration of graph theory and equivalence relation frameworks in formal verification contexts.

Scientific Awards: No awards or fellowships are documented in the provided repository data.

Advising and Grants: The profile contains no explicit references to supervised students or secured research grants. Advising activities appear limited to collaborative research outputs with senior colleagues like Groote, Keiren, and Wijs.

Labs and Teams: Jansen operates within TU/e's Formal System Analysis group, specializing in bisimulation techniques and model checking. This team falls under the Faculty of Mathematics and Computer Science and has produced datasets like the branching bisimilarity implementation on Figshare (2020).