#### Filter Results:

- Full text PDF available (31)

#### Publication Year

2002

2017

- This year (2)
- Last 5 years (7)
- Last 10 years (26)

#### Publication Type

#### Co-author

#### Journals and Conferences

#### Key Phrases

Learn More

In this paper we introduce the logic asCSL, an extension of continuous stochastic logic (CSL), which provides powerful means to characterise execution paths of actionand state-labelled Markov chains. In asCSL, path properties are characterised by regular expressions over actions and state-formulas. Thus, the executability of a path not only depends on the… (More)

- Christel Baier, Lucia Cloth, Boudewijn R. Haverkort, Matthias Kuntz, Markus Siegle
- IEEE Transactions on Software Engineering
- 2007

In the past, logics of several kinds have been proposed for reasoning about discrete-time or continuous-time Markov chains. Most of these logics rely on either state labels (atomic propositions) or on transition labels (actions). However, in several applications it is useful to reason about both state properties and action sequences. For this purpose, we… (More)

- Hichem Boudali, Pepijn Crouzen, Boudewijn R. Haverkort, Matthias Kuntz, Mariëlle Stoelinga
- 2008 IEEE International Conference on Dependable…
- 2008

This paper proposes a formally well-rooted and extensible framework for dependability evaluation: Arcade (architectural dependability evaluation). It has been designed to combine the strengths of previous approaches to the evaluation of dependability. A key feature is its formal semantics in terms of input/output-interactive Markov chains, which enables… (More)

- Matthias Kuntz, Markus Siegle, Edith Werner
- FORTE Workshops
- 2004

This paper describes the tool CASPA, a new performance evaluation tool which is based on a Markovian stochastic process algebra. CASPA uses multi-terminal binary decision diagrams (MTBDD) to represent the labelled continuous time Markov chain (CTMC) underlying a given process algebraic specification. All phases of modelling, from model construction to… (More)

In this paper, we introduce MIOA, a stochastic process algebralike specification language with datatypes, as well as a logic intSPDL, and its model checking algorithms. MIOA which stands for Markovian input/output automata language, is an extension of Lynch’s input/automata with Markovian timed transitions. MIOA can serve both as a fully fledged… (More)

- Matthias Kuntz, Florian Leitner-Fischer, Stefan Leue
- SAFECOMP
- 2011

Probabilistic Model Checking is an established technique used in the dependability analysis of safety-critical systems. In recent years, several approaches to generate probabilistic counterexamples have been proposed. The interpretation of stochastic counterexamples, however, continues to be problematic since they have to be represented as sets of paths,… (More)

- Hichem Boudali, Pepijn Crouzen, Boudewijn R. Haverkort, Matthias Kuntz, Mariëlle Stoelinga
- 13th IEEE International Conference on Engineering…
- 2008

This paper discusses the requirements that a suitable formalism for dependability modeling/evaluation should possess. We also discuss the outline of Arcade, an architectural dependability formalism that we are developing.

- C. Garcia-Mateo, Gregorio del Amo, +5 authors R. Elvira
- 2012

Much recent work has been devoted to characterize the microstructure and mechanical properties bainitic nanostructured steels. The microstructure is developed by isothermal heat treatment at temperatures as low as 125-350oC and adapted steel grades typically contain high carbon contents to achieve sufficient depletion of the BS-MS temperature range, and… (More)

Failure mode and effects analysis (FMEA) is a technique to reason about possible system hazards that result from system or system component failures. Traditionally, FMEA does not take the probabilities with which these failures may occur into account. Recently, this shortcoming was addressed by integrating stochastic model checking techniques into the FMEA… (More)

- Matthias Kuntz
- 2006

ion can be seen as the combination of all possible restrictions to a set of variables combined by an associative binary operator ⋆. Formally, this can be defined as follows: Abstract(B, (xi, ..., xm), ⋆) := B ∣ ∣ xi,...,xm:=(0,...,0) ⋆ ... ⋆ B ∣