activity
20122026
most citedDamage detection using in-domain and cross-domain transfer learning

59 citations · 291 across the 45 of their papers we have counts for

collaborators
Showing cs.SEShow all

5 papers · 1 filter

cs.SE2018★ 2 cited

Structured Synthesis for Probabilistic Systems

Nils Jansen, Laura Humphrey, Jana Tumova +1

We introduce the concept of structured synthesis for Markov decision processes where the structure is induced from finitely many pre-specified options for a system configuration. T…

cs.SE2015★ 6 cited

Safety-Constrained Reinforcement Learning for MDPs

Sebastian Junges, Nils Jansen, Christian Dehnert +2

We consider controller synthesis for stochastic and partially unknown environments in which safety is essential. Specifically, we abstract the problem as a Markov decision process…

cs.SE2013

Accelerating Parametric Probabilistic Verification

Nils Jansen, Florian Corzilius, Matthias Volk +4

We present a novel method for computing reachability probabilities of parametric discrete-time Markov chains whose transition probabilities are fractions of polynomials over a set…

cs.SE2013★ 13 cited

High-level Counterexamples for Probabilistic Automata

Ralf Wimmer, Nils Jansen, Erika Ábrahám +1

Providing compact and understandable counterexamples for violated system properties is an essential task in model checking. Existing works on counterexamples for probabilistic syst…

cs.SE2012★ 2 cited

The COMICS Tool - Computing Minimal Counterexamples for Discrete-time Markov Chains

Nils Jansen, Erika Ábrahám, Maik Scheffler +5

This report presents the tool COMICS, which performs model checking and generates counterexamples for DTMCs. For an input DTMC, COMICS computes an abstract system that carries the…