David N. Jansen

According to our database, David N. Jansen authored at least 52 papers between 2001 and 2023.

Collaborative distances:

• Dijkstra number of three.
• Erdős number of three.

2023

Rooted Divergence-Preserving Branching Bisimilarity is a Congruence for Guarded CCS.

Quan Sun, David N. Jansen, Xinxin Liu, Wei Zhang

Formal Aspects Comput., December, 2023

Linear-Time-Branching-Time Spectroscopy Accounting for Silent Steps.

Benjamin Bisping, David N. Jansen

CoRR, 2023

2022

Deciding All Behavioral Equivalences at Once: A Game for Linear-Time-Branching-Time Spectroscopy.

Benjamin Bisping, David N. Jansen, Uwe Nestmann

Log. Methods Comput. Sci., 2022

CHA: Supporting SVA-Like Assertions in Formal Verification of Chisel Programs (Tool Paper).

Shizhen Yu, Yifan Dong, Jiuyang Liu, Yong Li, Zhilin Wu, David N. Jansen, Lijun Zhang

Proceedings of the Software Engineering and Formal Methods - 20th International Conference, 2022

Rooted Divergence-Preserving Branching Bisimilarity is a Congruence: A Simpler Proof.

David N. Jansen, Xinxin Liu

Proceedings of the A Journey from Process Algebra via Timed Automata to Model Learning, 2022

2021

What do all these Buttons do? Statically Mining Android User Interfaces at Scale.

Konstantin Kuznetsov, Chen Fu, Song Gao, David N. Jansen, Lijun Zhang, Andreas Zeller

CoRR, 2021

Frontmatter: mining Android user interfaces at scale.

Konstantin Kuznetsov, Chen Fu, Song Gao, David N. Jansen, Lijun Zhang, Andreas Zeller

Proceedings of the ESEC/FSE '21: 29th ACM Joint European Software Engineering Conference and Symposium on the Foundations of Software Engineering, 2021

Formal Verification of Consensus in the Taurus Distributed Database.

Song Gao, Bohua Zhan, Depeng Liu, Xuechao Sun, Yanan Zhi, David N. Jansen, Lijun Zhang

Proceedings of the Formal Methods - 24th International Symposium, 2021

2020

An O(m log n) algorithm for branching bisimilarity on labelled transition systems.

David N. Jansen, Jan Friso Groote, Jeroen J. A. Keiren, Anton Wijs

Proceedings of the Tools and Algorithms for the Construction and Analysis of Systems, 2020

Accelerated Verification of Parametric Protocols with Decision Trees.

Yongjian Li, Taifeng Cao, David N. Jansen, Jun Pang, Xiaotao Wei

Proceedings of the 38th IEEE International Conference on Computer Design, 2020

A Near-Linear-Time Algorithm for Weak Bisimilarity on Markov Chains.

David N. Jansen, Jan Friso Groote, Ferry Timmers, Pengfei Yang

Proceedings of the 31st International Conference on Concurrency Theory, 2020

2019

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

David N. Jansen, Jan Friso Groote, Jeroen J. A. Keiren, Anton Wijs

CoRR, 2019

An Axiomatisation of the Probabilistic \mu -Calculus.

Junnan Xu, Wanwei Liu, David N. Jansen, Lijun Zhang

Proceedings of the Formal Methods and Software Engineering, 2019

2018

An Automatic Proving Approach to Parameterized Verification.

Yongjian Li, Kaiqiang Duan, David N. Jansen, Jun Pang, Lijun Zhang, Yi Lv, Shaowei Cai

ACM Trans. Comput. Log., 2018

Probabilistic bisimulation for realistic schedulers.

Lijun Zhang, Pengfei Yang, Lei Song, Holger Hermanns, Christian Eisentraut, David N. Jansen, Jens Chr. Godskesen

Acta Informatica, 2018

2017

An <i>O</i>(<i>m</i>log<i>n</i>) Algorithm for Computing Stuttering Equivalence and Branching Bisimulation.

Jan Friso Groote, David N. Jansen, Jeroen J. A. Keiren, Anton Wijs

ACM Trans. Comput. Log., 2017

On Equivalence Checking of Nondeterministic Finite Automata.

Chen Fu, Yuxin Deng, David N. Jansen, Lijun Zhang

Proceedings of the Dependable Software Engineering. Theories, Tools, and Applications, 2017

Distribution-Based Bisimulation for Labelled Markov Processes.

Pengfei Yang, David N. Jansen, Lijun Zhang

Proceedings of the Formal Modeling and Analysis of Timed Systems, 2017

Finding Polynomial Loop Invariants for Probabilistic Programs.

Yijun Feng, Lijun Zhang, David N. Jansen, Naijun Zhan, Bican Xia

Proceedings of the Automated Technology for Verification and Analysis, 2017

2016

Multiphase until formulas over Markov reward models: An algebraic approach.

Ming Xu, Lijun Zhang, David N. Jansen, Huibiao Zhu, Zongyuan Yang

Theor. Comput. Sci., 2016

A space-efficient simulation algorithm on probabilistic automata.

Lijun Zhang, David N. Jansen

Inf. Comput., 2016

Stuttering equivalence is too slow!

David N. Jansen, Jeroen J. A. Keiren

CoRR, 2016

Minimal Separating Sequences for All Pairs of States.

Rick Smetsers, Joshua Moerman, David N. Jansen

Proceedings of the Language and Automata Theory and Applications, 2016

2015

A Comparative Study of BDD Packages for Probabilistic Symbolic Model Checking.

Tom van Dijk, Ernst Moritz Hahn, David N. Jansen, Yong Li, Thomas Neele, Mariëlle Stoelinga, Andrea Turrini, Lijun Zhang

Proceedings of the Dependable Software Engineering: Theories, Tools, and Applications, 2015

Applying Automata Learning to Embedded Control Software.

Wouter Smeenk, Joshua Moerman, Frits W. Vaandrager, David N. Jansen

Proceedings of the Formal Methods and Software Engineering, 2015

2013

Revisiting Weak Simulation for Substochastic Markov Chains.

David N. Jansen, Lei Song, Lijun Zhang

Proceedings of the Quantitative Evaluation of Systems - 10th International Conference, 2013

More or Less True DCTL for Continuous-Time MDPs.

David N. Jansen

Proceedings of the Formal Modeling and Analysis of Timed Systems, 2013

2012

On Abstraction of Probabilistic Systems.

Christian Dehnert, Daniel Gebler, Michele Volpato, David N. Jansen

Proceedings of the Stochastic Model Checking. Rigorous Dependability Analysis Using Model Checking Techniques for Stochastic Systems, 2012

Belief Bisimulation for Hidden Markov Models - Logical Characterisation and Decision Algorithm.

David N. Jansen, Flemming Nielson, Lijun Zhang

Proceedings of the NASA Formal Methods, 2012

2011

The ins and outs of the probabilistic model checker MRMC.

Joost-Pieter Katoen, Ivan S. Zapreev, Ernst Moritz Hahn, Holger Hermanns, David N. Jansen

Perform. Evaluation, 2011

Automata-Based CSL Model Checking

Lijun Zhang, David N. Jansen, Flemming Nielson, Holger Hermanns

Log. Methods Comput. Sci., 2011

Erratum to: Model-checking continuous-time Markov chains by Aziz et al

David N. Jansen

CoRR, 2011

2010

Synthesis and stochastic assessment of cost-optimal schedules.

Angelika Mader, Henrik C. Bohnenkamp, Yaroslav S. Usenko, David N. Jansen, Johann L. Hurink, Holger Hermanns

Int. J. Softw. Tools Technol. Transf., 2010

The axiomatization of override and update.

Jasper Berendsen, David N. Jansen, Julien Schmaltz, Frits W. Vaandrager

J. Appl. Log., 2010

Fortuna: Model Checking Priced Probabilistic Timed Automata.

Jasper Berendsen, David N. Jansen, Frits W. Vaandrager

Proceedings of the QEST 2010, 2010

2009

Undecidability of Cost-Bounded Reachability in Priced Probabilistic Timed Automata.

Jasper Berendsen, Taolue Chen, David N. Jansen

Proceedings of the Theory and Applications of Models of Computation, 6th Annual Conference, 2009

2008

Flow Faster: Efficient Decision Algorithms for Probabilistic Simulations.

Lijun Zhang, Holger Hermanns, Friedrich Eisenbrand, David N. Jansen

Log. Methods Comput. Sci., 2008

2007

Bisimulation Minimisation Mostly Speeds Up Probabilistic Model Checking.

Joost-Pieter Katoen, Tim Kemna, Ivan S. Zapreev, David N. Jansen

Proceedings of the Tools and Algorithms for the Construction and Analysis of Systems, 2007

How Fast and Fat Is Your Probabilistic Model Checker? An Experimental Performance Comparison.

David N. Jansen, Joost-Pieter Katoen, Marcel Oldenkamp, Mariëlle Stoelinga, Ivan S. Zapreev

Proceedings of the Hardware and Software: Verification and Testing, 2007

07101 Working Group Report -- Performance Measures Other Than Time.

Lucia Cloth, Pepijn Crouzen, Matthias Fruth, Tingting Han, David N. Jansen, Mark Kattenbelt, Gerard J. M. Smit, Lijun Zhang

Proceedings of the Quantitative Aspects of Embedded Systems, 04.03. - 09.03.2007, 2007

2006

Probably on Time and within Budget: On Reachability in Priced Probabilistic Timed Automata.

Jasper Berendsen, David N. Jansen, Joost-Pieter Katoen

Proceedings of the Third International Conference on the Quantitative Evaluation of Systems (QEST 2006), 2006

2005

QoS modelling and analysis with UML-statecharts: the StoCharts approach.

David N. Jansen, Holger Hermanns

SIGMETRICS Perform. Evaluation Rev., 2005

From StoCharts to MoDeST: a comparative reliability analysis of train radio communications.

Holger Hermanns, David N. Jansen, Yaroslav S. Usenko

Proceedings of the Fifth International Workshop on Software and Performance, 2005

Logic and Model Checking for Hidden Markov Models.

Lijun Zhang, Holger Hermanns, David N. Jansen

Proceedings of the Formal Techniques for Networked and Distributed Systems, 2005

2004

Dependability Checking with StoCharts: Is Train Radio Reliable Enough for Trains?

David N. Jansen, Holger Hermanns

Proceedings of the 1st International Conference on Quantitative Evaluation of Systems (QEST 2004), 2004

An industrial-strength formal method -- A Modest survey.

Henrik C. Bohnenkamp, Holger Hermanns, David N. Jansen, Joost-Pieter Katoen, Yaroslav S. Usenko

Proceedings of the International Symposium on Leveraging Applications of Formal Methods, 2004

2003

Extensions of Statecharts with probability, time, and stochastic timing.

David N. Jansen

PhD thesis, 2003

A QoS-Oriented Extension of UML Statecharts.

David N. Jansen, Holger Hermanns, Joost-Pieter Katoen

Proceedings of the «UML» 2003, 2003

2002

Requirements-Level Semantics and Model Checking of Object-Oriented Statecharts.

Rik Eshuis, David N. Jansen, Roel J. Wieringa

Requir. Eng., 2002

Extending CTL with Actions and Real Time.

David N. Jansen, Roel J. Wieringa

J. Log. Comput., 2002

A Probabilistic Extension of UML Statecharts.

David N. Jansen, Holger Hermanns, Joost-Pieter Katoen

Proceedings of the Formal Techniques in Real-Time and Fault-Tolerant Systems, 2002

2001

Techniques for Reactive System Design: The Tools in TRADE.

Roel J. Wieringa, David N. Jansen

Proceedings of the Advanced Information Systems Engineering, 13th International Conference, 2001