David N. Jansen

ORCID

Publication Activity (10 Years)

Years Active: 2001-2023
Publications (10 Years): 27

Top Venues

CoRR

FORMATS

SETTA

ACM Trans. Comput. Log.

University of Twente, Enschede, Netherlands (PHD)

Education History

University of Twente, Enschede, Netherlands

PHD

Publications

Benjamin Bisping, David N. Jansen
Linear-Time-Branching-Time Spectroscopy Accounting for Silent Steps. CoRR (2023)
Quan Sun, David N. Jansen, Xinxin Liu, Wei Zhang
Rooted Divergence-Preserving Branching Bisimilarity is a Congruence for Guarded CCS. Formal Aspects Comput. 35 (4) (2023)
Benjamin Bisping, David N. Jansen, Uwe Nestmann
Deciding All Behavioral Equivalences at Once: A Game for Linear-Time-Branching-Time Spectroscopy. Log. Methods Comput. Sci. 18 (3) (2022)
David N. Jansen, Xinxin Liu
Rooted Divergence-Preserving Branching Bisimilarity is a Congruence: A Simpler Proof. A Journey from Process Algebra via Timed Automata to Model Learning (2022)
Shizhen Yu, Yifan Dong, Jiuyang Liu, Yong Li, Zhilin Wu, David N. Jansen, Lijun Zhang
CHA: Supporting SVA-Like Assertions in Formal Verification of Chisel Programs (Tool Paper). SEFM (2022)
Song Gao, Bohua Zhan, Depeng Liu, Xuechao Sun, Yanan Zhi, David N. Jansen, Lijun Zhang
Formal Verification of Consensus in the Taurus Distributed Database. FM (2021)
Konstantin Kuznetsov, Chen Fu, Song Gao, David N. Jansen, Lijun Zhang, Andreas Zeller
What do all these Buttons do? Statically Mining Android User Interfaces at Scale. CoRR (2021)
Konstantin Kuznetsov, Chen Fu, Song Gao, David N. Jansen, Lijun Zhang, Andreas Zeller
Frontmatter: mining Android user interfaces at scale. ESEC/SIGSOFT FSE (2021)
Yongjian Li, Taifeng Cao, David N. Jansen, Jun Pang, Xiaotao Wei
Accelerated Verification of Parametric Protocols with Decision Trees. ICCD (2020)
David N. Jansen, Jan Friso Groote, Ferry Timmers, Pengfei Yang
A Near-Linear-Time Algorithm for Weak Bisimilarity on Markov Chains. CONCUR (2020)
David N. Jansen, Jan Friso Groote, Jeroen J. A. Keiren, Anton Wijs
An O(m log n) algorithm for branching bisimilarity on labelled transition systems. TACAS (2) (2020)
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 (2019)
Junnan Xu, Wanwei Liu, David N. Jansen, Lijun Zhang
An Axiomatisation of the Probabilistic \mu -Calculus. ICFEM (2019)
Lijun Zhang, Pengfei Yang, Lei Song, Holger Hermanns, Christian Eisentraut, David N. Jansen, Jens Chr. Godskesen
Probabilistic bisimulation for realistic schedulers. Acta Informatica 55 (6) (2018)
Yongjian Li, Kaiqiang Duan, David N. Jansen, Jun Pang, Lijun Zhang, Yi Lv, Shaowei Cai
An Automatic Proving Approach to Parameterized Verification. ACM Trans. Comput. Log. 19 (4) (2018)
Yijun Feng, Lijun Zhang, David N. Jansen, Naijun Zhan, Bican Xia
Finding Polynomial Loop Invariants for Probabilistic Programs. ATVA (2017)
Pengfei Yang, David N. Jansen, Lijun Zhang
Distribution-Based Bisimulation for Labelled Markov Processes. FORMATS (2017)
Chen Fu, Yuxin Deng, David N. Jansen, Lijun Zhang
On Equivalence Checking of Nondeterministic Finite Automata. SETTA (2017)
Yijun Feng, Lijun Zhang, David N. Jansen, Naijun Zhan, Bican Xia
Finding polynomial loop invariants for probabilistic programs. CoRR (2017)
Pengfei Yang, David N. Jansen, Lijun Zhang
Distribution-based bisimulation for labelled Markov processes. CoRR (2017)
Jan Friso Groote, David N. Jansen, Jeroen J. A. Keiren, Anton Wijs
) Algorithm for Computing Stuttering Equivalence and Branching Bisimulation. ACM Trans. Comput. Log. 18 (2) (2017)
Rick Smetsers, Joshua Moerman, David N. Jansen
Minimal Separating Sequences for All Pairs of States. LATA (2016)
Ming Xu, Lijun Zhang, David N. Jansen, Huibiao Zhu, Zongyuan Yang
Multiphase until formulas over Markov reward models: An algebraic approach. Theor. Comput. Sci. 611 (2016)
David N. Jansen, Jeroen J. A. Keiren
Stuttering equivalence is too slow! CoRR (2016)
Lijun Zhang, David N. Jansen
A space-efficient simulation algorithm on probabilistic automata. Inf. Comput. 249 (2016)
Wouter Smeenk, Joshua Moerman, Frits W. Vaandrager, David N. Jansen
Applying Automata Learning to Embedded Control Software. ICFEM (2015)
Tom van Dijk, Ernst Moritz Hahn, David N. Jansen, Yong Li, Thomas Neele, Mariëlle Stoelinga, Andrea Turrini, Lijun Zhang
A Comparative Study of BDD Packages for Probabilistic Symbolic Model Checking. SETTA (2015)
David N. Jansen
More or Less True DCTL for Continuous-Time MDPs. FORMATS (2013)
David N. Jansen, Lei Song, Lijun Zhang
Revisiting Weak Simulation for Substochastic Markov Chains. QEST (2013)
David N. Jansen, Flemming Nielson, Lijun Zhang
Belief Bisimulation for Hidden Markov Models - Logical Characterisation and Decision Algorithm. NASA Formal Methods (2012)
Christian Dehnert, Daniel Gebler, Michele Volpato, David N. Jansen
On Abstraction of Probabilistic Systems. ROCKS (2012)
Joost-Pieter Katoen, Ivan S. Zapreev, Ernst Moritz Hahn, Holger Hermanns, David N. Jansen
The ins and outs of the probabilistic model checker MRMC. Perform. Evaluation 68 (2) (2011)
Lijun Zhang, David N. Jansen, Flemming Nielson, Holger Hermanns
Automata-Based CSL Model Checking Log. Methods Comput. Sci. 8 (2) (2011)
David N. Jansen
Erratum to: Model-checking continuous-time Markov chains by Aziz et al CoRR (2011)
Lijun Zhang, David N. Jansen, Flemming Nielson, Holger Hermanns
Automata-Based CSL Model Checking. ICALP (2) (2011)
Jasper Berendsen, David N. Jansen, Julien Schmaltz, Frits W. Vaandrager
The axiomatization of override and update. J. Appl. Log. 8 (1) (2010)
Angelika Mader, Henrik C. Bohnenkamp, Yaroslav S. Usenko, David N. Jansen, Johann L. Hurink, Holger Hermanns
Synthesis and stochastic assessment of cost-optimal schedules. Int. J. Softw. Tools Technol. Transf. 12 (5) (2010)
Jasper Berendsen, David N. Jansen, Frits W. Vaandrager
Fortuna: Model Checking Priced Probabilistic Timed Automata. QEST (2010)
Jasper Berendsen, Taolue Chen, David N. Jansen
Undecidability of Cost-Bounded Reachability in Priced Probabilistic Timed Automata. TAMC (2009)
Joost-Pieter Katoen, Ivan S. Zapreev, Ernst Moritz Hahn, Holger Hermanns, David N. Jansen
The Ins and Outs of the Probabilistic Model Checker MRMC. QEST (2009)
Lijun Zhang, Holger Hermanns, Friedrich Eisenbrand, David N. Jansen
Flow Faster: Efficient Decision Algorithms for Probabilistic Simulations CoRR (2008)
Lijun Zhang, Holger Hermanns, Friedrich Eisenbrand, David N. Jansen
Flow Faster: Efficient Decision Algorithms for Probabilistic Simulations. Log. Methods Comput. Sci. 4 (4) (2008)
Lucia Cloth, Pepijn Crouzen, Matthias Fruth, Tingting Han, David N. Jansen, Mark Kattenbelt, Gerard J. M. Smit, Lijun Zhang
07101 Working Group Report -- Performance Measures Other Than Time. Quantitative Aspects of Embedded Systems (2007)
Lijun Zhang, Holger Hermanns, Friedrich Eisenbrand, David N. Jansen
Flow Faster: Efficient Decision Algorithms for Probabilistic Simulations. TACAS (2007)
David N. Jansen, Joost-Pieter Katoen, Marcel Oldenkamp, Mariëlle Stoelinga, Ivan S. Zapreev
How Fast and Fat Is Your Probabilistic Model Checker? An Experimental Performance Comparison. Haifa Verification Conference (2007)
Joost-Pieter Katoen, Tim Kemna, Ivan S. Zapreev, David N. Jansen
Bisimulation Minimisation Mostly Speeds Up Probabilistic Model Checking. TACAS (2007)
Jasper Berendsen, David N. Jansen, Joost-Pieter Katoen
Probably on Time and within Budget: On Reachability in Priced Probabilistic Timed Automata. QEST (2006)
Lijun Zhang, Holger Hermanns, David N. Jansen
Logic and Model Checking for Hidden Markov Models. FORTE (2005)
David N. Jansen, Holger Hermanns
QoS modelling and analysis with UML-statecharts: the StoCharts approach. SIGMETRICS Perform. Evaluation Rev. 32 (4) (2005)
Holger Hermanns, David N. Jansen, Yaroslav S. Usenko
From StoCharts to MoDeST: a comparative reliability analysis of train radio communications. WOSP (2005)
Henrik C. Bohnenkamp, Holger Hermanns, David N. Jansen, Joost-Pieter Katoen, Yaroslav S. Usenko
An industrial-strength formal method -- A Modest survey. ISoLA (Preliminary proceedings) (2004)
David N. Jansen, Holger Hermanns
Dependability Checking with StoCharts: Is Train Radio Reliable Enough for Trains? QEST (2004)
David N. Jansen, Holger Hermanns, Joost-Pieter Katoen
A QoS-Oriented Extension of UML Statecharts. UML (2003)
Rik Eshuis, David N. Jansen, Roel J. Wieringa
Requirements-Level Semantics and Model Checking of Object-Oriented Statecharts. Requir. Eng. 7 (4) (2002)
David N. Jansen, Roel J. Wieringa
Extending CTL with Actions and Real Time. J. Log. Comput. 12 (4) (2002)
David N. Jansen, Holger Hermanns, Joost-Pieter Katoen
A Probabilistic Extension of UML Statecharts. FTRTFT (2002)
Roel J. Wieringa, David N. Jansen
Techniques for Reactive System Design: The Tools in TRADE. CAiSE (2001)

David N. Jansen.css-eqlu8i{font-size:small;padding-left:4px;}

Publication Activity (10 Years)

Top Topics

Top Venues

David N. Jansen