default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDDavid N. Jansen
Person information
SPARQL queries 
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
[j15]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): 25:1-25:21 (2023)- [i9]Benjamin Bisping, David N. Jansen:
Linear-Time-Branching-Time Spectroscopy Accounting for Silent Steps. CoRR abs/2305.17671 (2023) - 2022
- [j14]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) - [c33]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: 358-370 - [c32]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: 324-331 - 2021
- [c31]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: 741-751 - [c30]Konstantin Kuznetsov, Chen Fu, Song Gao, David N. Jansen, Lijun Zhang, Andreas Zeller:
Frontmatter: mining Android user interfaces at scale. ESEC/SIGSOFT FSE 2021: 1580-1584 - [i8]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 abs/2105.03144 (2021) - 2020
- [c29]David N. Jansen, Jan Friso Groote, Ferry Timmers, Pengfei Yang:
A Near-Linear-Time Algorithm for Weak Bisimilarity on Markov Chains. CONCUR 2020: 8:1-8:20 - [c28]Yongjian Li, Taifeng Cao, David N. Jansen, Jun Pang, Xiaotao Wei:
Accelerated Verification of Parametric Protocols with Decision Trees. ICCD 2020: 397-404 - [c27]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: 3-20 - [e2]Marco Gribaudo, David N. Jansen, Anne Remke:
Quantitative Evaluation of Systems - 17th International Conference, QEST 2020, Vienna, Austria, August 31 - September 3, 2020, Proceedings. Lecture Notes in Computer Science 12289, Springer 2020, ISBN 978-3-030-59853-2 [contents]
2010 – 2019
- 2019
- [c26]Junnan Xu, Wanwei Liu, David N. Jansen, Lijun Zhang:
An Axiomatisation of the Probabilistic \mu -Calculus. ICFEM 2019: 420-437 - [i7]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 abs/1909.10824 (2019) - 2018
- [j13]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): 461-488 (2018) - [j12]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): 27:1-27:25 (2018) - [e1]David N. Jansen, Pavithra Prabhakar:
Formal Modeling and Analysis of Timed Systems - 16th International Conference, FORMATS 2018, Beijing, China, September 4-6, 2018, Proceedings. Lecture Notes in Computer Science 11022, Springer 2018, ISBN 978-3-030-00150-6 [contents] - 2017
- [j11]Jan Friso Groote, David N. Jansen, Jeroen J. A. Keiren, Anton Wijs:
An O(mlogn) Algorithm for Computing Stuttering Equivalence and Branching Bisimulation. ACM Trans. Comput. Log. 18(2): 13:1-13:34 (2017) - [c25]Yijun Feng, Lijun Zhang, David N. Jansen, Naijun Zhan, Bican Xia:
Finding Polynomial Loop Invariants for Probabilistic Programs. ATVA 2017: 400-416 - [c24]Pengfei Yang, David N. Jansen, Lijun Zhang:
Distribution-Based Bisimulation for Labelled Markov Processes. FORMATS 2017: 170-186 - [c23]Chen Fu, Yuxin Deng, David N. Jansen, Lijun Zhang:
On Equivalence Checking of Nondeterministic Finite Automata. SETTA 2017: 216-231 - [i6]Pengfei Yang, David N. Jansen, Lijun Zhang:
Distribution-based bisimulation for labelled Markov processes. CoRR abs/1706.10049 (2017) - [i5]Yijun Feng, Lijun Zhang, David N. Jansen, Naijun Zhan, Bican Xia:
Finding polynomial loop invariants for probabilistic programs. CoRR abs/1707.02690 (2017) - 2016
- [j10]Lijun Zhang, David N. Jansen:
A space-efficient simulation algorithm on probabilistic automata. Inf. Comput. 249: 138-159 (2016) - [j9]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: 116-135 (2016) - [c22]Rick Smetsers, Joshua Moerman, David N. Jansen:
Minimal Separating Sequences for All Pairs of States. LATA 2016: 181-193 - [i4]David N. Jansen, Jeroen J. A. Keiren:
Stuttering equivalence is too slow! CoRR abs/1603.05789 (2016) - 2015
- [c21]Wouter Smeenk, Joshua Moerman, Frits W. Vaandrager, David N. Jansen:
Applying Automata Learning to Embedded Control Software. ICFEM 2015: 67-83 - [c20]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: 35-51 - 2013
- [c19]David N. Jansen:
More or Less True DCTL for Continuous-Time MDPs. FORMATS 2013: 137-151 - [c18]David N. Jansen, Lei Song, Lijun Zhang:
Revisiting Weak Simulation for Substochastic Markov Chains. QEST 2013: 209-224 - 2012
- [c17]David N. Jansen, Flemming Nielson, Lijun Zhang:
Belief Bisimulation for Hidden Markov Models - Logical Characterisation and Decision Algorithm. NASA Formal Methods 2012: 326-340 - [c16]Christian Dehnert, Daniel Gebler, Michele Volpato, David N. Jansen:
On Abstraction of Probabilistic Systems. ROCKS 2012: 87-116 - 2011
- [j8]Lijun Zhang, David N. Jansen, Flemming Nielson, Holger Hermanns:
Automata-Based CSL Model Checking. Log. Methods Comput. Sci. 8(2) (2011) - [j7]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): 90-104 (2011) - [c15]Lijun Zhang, David N. Jansen, Flemming Nielson, Holger Hermanns:
Automata-Based CSL Model Checking. ICALP (2) 2011: 271-282 - [i3]David N. Jansen:
Erratum to: Model-checking continuous-time Markov chains by Aziz et al. CoRR abs/1102.2079 (2011) - 2010
- [j6]Jasper Berendsen, David N. Jansen, Julien Schmaltz, Frits W. Vaandrager:
The axiomatization of override and update. J. Appl. Log. 8(1): 141-150 (2010) - [j5]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): 305-318 (2010) - [c14]Jasper Berendsen, David N. Jansen, Frits W. Vaandrager:
Fortuna: Model Checking Priced Probabilistic Timed Automata. QEST 2010: 273-281
2000 – 2009
- 2009
- [c13]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: 167-176 - [c12]Jasper Berendsen, Taolue Chen, David N. Jansen:
Undecidability of Cost-Bounded Reachability in Priced Probabilistic Timed Automata. TAMC 2009: 128-137 - 2008
- [j4]Lijun Zhang, Holger Hermanns, Friedrich Eisenbrand, David N. Jansen:
Flow Faster: Efficient Decision Algorithms for Probabilistic Simulations. Log. Methods Comput. Sci. 4(4) (2008) - [i2]Lijun Zhang, Holger Hermanns, Friedrich Eisenbrand, David N. Jansen:
Flow Faster: Efficient Decision Algorithms for Probabilistic Simulations. CoRR abs/0808.3651 (2008) - 2007
- [c11]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: 69-85 - [c10]Joost-Pieter Katoen, Tim Kemna, Ivan S. Zapreev, David N. Jansen:
Bisimulation Minimisation Mostly Speeds Up Probabilistic Model Checking. TACAS 2007: 87-101 - [c9]Lijun Zhang, Holger Hermanns, Friedrich Eisenbrand, David N. Jansen:
Flow Faster: Efficient Decision Algorithms for Probabilistic Simulations. TACAS 2007: 155-169 - [i1]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 - 2006
- [c8]Jasper Berendsen, David N. Jansen, Joost-Pieter Katoen:
Probably on Time and within Budget: On Reachability in Priced Probabilistic Timed Automata. QEST 2006: 311-322 - 2005
- [j3]David N. Jansen, Holger Hermanns:
QoS modelling and analysis with UML-statecharts: the StoCharts approach. SIGMETRICS Perform. Evaluation Rev. 32(4): 28-33 (2005) - [c7]Lijun Zhang, Holger Hermanns, David N. Jansen:
Logic and Model Checking for Hidden Markov Models. FORTE 2005: 98-112 - [c6]Holger Hermanns, David N. Jansen, Yaroslav S. Usenko:
From StoCharts to MoDeST: a comparative reliability analysis of train radio communications. WOSP 2005: 13-23 - 2004
- [c5]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: 284-295 - [c4]David N. Jansen, Holger Hermanns:
Dependability Checking with StoCharts: Is Train Radio Reliable Enough for Trains? QEST 2004: 250-259 - 2003
- [b1]David N. Jansen:
Extensions of Statecharts with probability, time, and stochastic timing. University of Twente, Enschede, Netherlands, 2003 - [c3]David N. Jansen, Holger Hermanns, Joost-Pieter Katoen:
A QoS-Oriented Extension of UML Statecharts. UML 2003: 76-91 - 2002
- [j2]David N. Jansen, Roel J. Wieringa:
Extending CTL with Actions and Real Time. J. Log. Comput. 12(4): 607-621 (2002) - [j1]Rik Eshuis, David N. Jansen, Roel J. Wieringa:
Requirements-Level Semantics and Model Checking of Object-Oriented Statecharts. Requir. Eng. 7(4): 243-263 (2002) - [c2]David N. Jansen, Holger Hermanns, Joost-Pieter Katoen:
A Probabilistic Extension of UML Statecharts. FTRTFT 2002: 355-374 - 2001
- [c1]Roel J. Wieringa, David N. Jansen:
Techniques for Reactive System Design: The Tools in TRADE. CAiSE 2001: 93-107
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-09-04 01:26 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
