David N. Jansen

From MaRDI portal
Person:896907


List of research outcomes

This list is not complete and representing at the moment only items from zbMATH Open and arXiv. We are working on additional sources - please check back here soon!

PublicationDate of PublicationType
Rooted divergence-preserving branching bisimilarity is a congruence: a simpler proof
Lecture Notes in Computer Science
2023-07-26Paper
On Equivalence Checking of Nondeterministic Finite Automata
Dependable Software Engineering. Theories, Tools, and Applications
2022-11-04Paper
scientific article; zbMATH DE number 7577583 (Why is no real title available?)
 
2022-08-30Paper
Finding polynomial loop invariants for probabilistic programs
Automated Technology for Verification and Analysis
2022-08-12Paper
scientific article; zbMATH DE number 7559464 (Why is no real title available?)
 
2022-07-18Paper
An \(O(m \log n)\) algorithm for branching bisimilarity on labelled transition systems
Tools and Algorithms for the Construction and Analysis of Systems
2021-11-10Paper
An automatic proving approach to parameterized verification
ACM Transactions on Computational Logic
2019-02-07Paper
Probabilistic bisimulation for realistic schedulers
Acta Informatica
2018-09-06Paper
Distribution-based bisimulation for labelled Markov processes
 
2017-12-01Paper
An \(\mathcal O(m\log n)\) algorithm for computing stuttering equivalence and branching bisimulation
ACM Transactions on Computational Logic
2017-07-13Paper
A space-efficient simulation algorithm on probabilistic automata
Information and Computation
2016-07-07Paper
Minimal separating sequences for all pairs of states
Language and Automata Theory and Applications
2016-04-13Paper
Multiphase until formulas over Markov reward models: an algebraic approach
Theoretical Computer Science
2015-12-15Paper
On Abstraction of Probabilistic Systems
Stochastic Model Checking. Rigorous Dependability Analysis Using Model Checking Techniques for Stochastic Systems
2015-01-12Paper
More or less true DCTL for continuous-time MDPs
Lecture Notes in Computer Science
2013-08-16Paper
Efficient CSL model checking using stratification
Logical Methods in Computer Science
2012-08-15Paper
Automata-based CSL model checking
Automata, Languages and Programming
2011-07-07Paper
A probabilistic extension of UML statecharts specification and verification
Lecture Notes in Computer Science
2011-04-08Paper
The axiomatization of override and update
Journal of Applied Logic
2010-06-11Paper
Undecidability of Cost-Bounded Reachability in Priced Probabilistic Timed Automata
Lecture Notes in Computer Science
2009-06-03Paper
Flow Faster: Efficient Decision Algorithms for Probabilistic Simulations
Logical Methods in Computer Science
2009-04-29Paper
Bisimulation Minimisation Mostly Speeds Up Probabilistic Model Checking
Tools and Algorithms for the Construction and Analysis of Systems
2007-09-03Paper
Flow Faster: Efficient Decision Algorithms for Probabilistic Simulations
Tools and Algorithms for the Construction and Analysis of Systems
2007-09-03Paper
Formal Techniques for Networked and Distributed Systems - FORTE 2005
 
2006-07-07Paper
Extending CTL with Actions and Real Time
Journal Of Logic And Computation
2002-12-15Paper
scientific article; zbMATH DE number 1708017 (Why is no real title available?)
 
2002-02-19Paper


Research outcomes over time


This page was built for person: David N. Jansen