activity
20152023
most citedSafety Analysis for Vehicle Guidance Systems with Dynamic Fault Trees

59 citations · 191 across the 36 of their papers we have counts for

collaborators
Showing 2019Show all

8 papers · 1 filter

cs.LO2019

Scenario-Based Verification of Uncertain MDPs

Murat Cubuktepe, Nils Jansen, Sebastian Junges +2

We consider Markov decision processes (MDPs) in which the transition probabilities and rewards belong to an uncertainty set parametrized by a collection of random variables. The pr…

cs.LO2019

Are Parametric Markov Chains Monotonic?

Jip Spel, Sebastian Junges, Joost-Pieter Katoen

This paper presents a simple algorithm to check whether reachability probabilities in parametric Markov chains are monotonic in (some of) the parameters. The idea is to construct -…

cs.SE2019

Counterexample-Driven Synthesis for Probabilistic Program Sketches

Milan Češka, Christian Hensel, Sebastian Junges +1

Probabilistic programs are key to deal with uncertainty in e.g. controller synthesis. They are typically small but intricate. Their development is complex and error prone requiring…

cs.LO2019★ 7 cited

On the Complexity of Reachability in Parametric Markov Decision Processes

Tobias Winkler, Sebastian Junges, Guillermo A. Pérez +1

This paper studies parametric Markov decision processes (pMDPs), an extension to Markov decision processes (MDPs) where transitions probabilities are described by polynomials over…

cs.LO2019

Shepherding Hordes of Markov Chains

Milan Ceska, Nils Jansen, Sebastian Junges +1

This paper considers large families of Markov chains (MCs) that are defined over a set of parameters with finite discrete domains. Such families occur in software product lines, pl…

cs.SE2019★ 59 cited

Safety Analysis for Vehicle Guidance Systems with Dynamic Fault Trees

Majdi Ghadhab, Sebastian Junges, Joost-Pieter Katoen +2

This paper considers the design-phase safety analysis of vehicle guidance systems. The proposed approach constructs dynamic fault trees (DFTs) to model a variety of safety concepts…

cs.FL2019★ 4 cited

Alternating Weak Automata from Universal Trees

Laure Daviaud, Marcin Jurdziński, Karoliina Lehtinen

An improved translation from alternating parity automata on infinite words to alternating weak automata is given. The blow-up of the number of states is related to the size of the…

cs.LO2019★ 1 cited

Parameter Synthesis for Markov Models: Covering the Parameter Space

Sebastian Junges, Erika Ábrahám, Christian Hensel +4

Markov chain analysis is a key technique in formal verification. A practical obstacle is that all probabilities in Markov models need to be known. However, system quantities such a…