Network


Latest external collaboration on country level. Dive into details by clicking on the dots.

Hotspot


Dive into the research topics where Markus Siegle is active.

Publication


Featured researches published by Markus Siegle.


Performance Evaluation | 2000

Compositional performance modelling with the TIPPtool

Holger Hermanns; Ulrich Herzog; Ulrich Klehmet; Vassilis Mertsiotakis; Markus Siegle

Stochastic process algebras have been proposed as compositional specification formalisms for performance models. In this paper, we describe a tool which aims at realising all beneficial aspects of compositional performance modelling, the TIPPtool. It incorporates methods for compositional specification as well as solution, based on state-of-the-art techniques, and wrapped in a user-friendly graphical front end. Apart from highlighting the general benefits of the tool, we also discuss some lessons learned during development and application of the TIPPtool. A non-trivial model of a real life communication system serves as a case study to illustrate benefits and limitations.


tools and algorithms for construction and analysis of systems | 2000

A Markov Chain Model Checker

Holger Hermanns; Joost-Pieter Katoen; Joachim Meyer-Kayser; Markus Siegle

Markov chains are widely used in the context of performance and reliability evaluation of systems of various nature. Model checking of such chains with respect to a given (branching) temporal logic formula has been proposed for both the discrete and the continuous time setting. In this paper, we describe a prototype model checker for discrete and continuous-time Markov chains, the Erlangen-Twente Markov Chain Checker (E ⊢ MC2), where properties are expressed in appropriate extensions of CTL. We illustrate the general benefits of this approach and discuss the structure of the tool. Furthermore we report on first successful applications of the tool to non-trivial examples, highlighting lessons learned during development and application of E ⊢ MC2.


Lecture Notes in Computer Science | 2004

Validation of Stochastic Systems

Christel Baier; Boudewijn R. Haverkort; Holger Hermanns; Joost-Pieter Katoen; Markus Siegle

We survey various notions of probabilistic automata and probabilistic bisimulation, accumulating in an expressiveness hierarchy of probabilistic system types. The aim of this paper is twofold: On the one hand it provides an overview of existing types of probabilistic systems and, on the other hand, it explains the relationship between these models. We overview probabilistic systems with discrete probabilities only. The expressiveness order used to built the hierarchy is defined via the existence of mappings between the corresponding system types that preserve and reflect bisimilarity. Additionally, we discuss parallel composition for the presented types of systems, augmenting the map of probabilistic automata with closedness under this compositional operator.


IEEE Transactions on Parallel and Distributed Systems | 1994

Distributed performance monitoring: methods, tools, and applications

Richard Hofmann; Rainer Klar; Bernd Mohr; Andreas Quick; Markus Siegle

A method for analyzing the functional behavior and the performance of programs in distributed systems is presented. We use hybrid monitoring, a technique which combines advantages of both software monitoring and hardware monitoring. The paper contains a description of a hardware monitor and a software package (ZM4/SIMPLE) which make our concepts available to programmers, assisting them in debugging and tuning of their code. A short survey of related monitor systems highlights the distinguishing features of our implementation. As an application of our monitoring and evaluation system, the analysis of a parallel ray tracing program running on the SUPRENUM multiprocessor is described. It is shown that monitoring and modeling both rely on a common abstraction of a systems dynamic behavior and therefore can be integrated to one comprehensive methodology. This methodology is supported by a set of tools. >


tools and algorithms for construction and analysis of systems | 2003

A tool for model-checking Markov chains

Holger Hermanns; Joost-Pieter Katoen; Joachim Meyer-Kayser; Markus Siegle

Abstract.Markov chains are widely used in the context of the performance and reliability modeling of various systems. Model checking of such chains with respect to a given (branching) temporal logic formula has been proposed for both discrete [34, 10] and continuous time settings [7, 12]. In this paper, we describe a prototype model checker for discrete and continuous-time Markov chains, the Erlangen–Twente Markov Chain Checker E⊢MC2, where properties are expressed in appropriate extensions of CTL. We illustrate the general benefits of this approach and discuss the structure of the tool. Furthermore, we report on successful applications of the tool to some examples, highlighting lessons learned during the development and application of E⊢MC2.


The Journal of Logic and Algebraic Programming | 2003

On the use of MTBDDs for performability analysis and verification of stochastic systems

Holger Hermanns; Marta Z. Kwiatkowska; Gethin Norman; David Parker; Markus Siegle

This paper describes how to employ multi-terminal binary decision diagrams (MTBDDs) for the construction and analysis of a general class of models that exhibit stochastic, probabilistic and non-deterministic behaviour. It is shown how the notorious problem of state space explosion can be circumvented by compositionally constructing symbolic (i.e. MTBDD-based) representations of complex systems from small-scale components. We emphasise, however, that compactness of the representation can only be achieved if heuristics are applied with insight into the structure of the system under investigation. We report on our experiences concerning compact representation, performance analysis and verification of performability properties.


IEEE Transactions on Software Engineering | 2007

Model Checking Markov Chains with Actions and State Labels

Christel Baier; Lucia Cloth; Boudewijn R. Haverkort; Matthias Kuntz; Markus Siegle

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 introduce the logic as CSL which provides a powerful means to characterize execution paths of Markov chains with actions and state labels. asCSL can be regarded as an extension of the purely state-based logic CSL (continuous stochastic logic). In asCSL, path properties are characterized by regular expressions over actions and state formulas. Thus, the truth value of path formulas depends not only on the available actions in a given time interval, but also on the validity of certain state formulas in intermediate states. We compare the expressive power of CSL and asCSL and show that even the state-based fragment of asCSL is strictly more expressive than CSL if time intervals starting at zero are employed. Using an automaton-based technique, an asCSL formula and a Markov chain with actions and state labels are combined into a product Markov chain. For time intervals starting at zero, we establish a reduction of the model checking problem for asCSL to CSL model checking on this product Markov chain. The usefulness of our approach is illustrated with an elaborate model of a scalable cellular communication system, for which several properties are formalized by means of asCSL formulas and checked using the new procedure


integrated formal methods | 2000

Towards Model Checking Stochastic Process Algebra

Holger Hermanns; Joost-Pieter Katoen; Joachim Meyer-Kayser; Markus Siegle

Stochastic process algebras have been proven useful because they allow behaviour-oriented performance and reliability modelling. As opposed to traditional performance modelling techniques, the behaviour-oriented style supports composition and abstraction in a natural way. However, analysis of stochastic process algebra models is state-oriented, because standard numerical analysis is typically based on the calculation of (transient and steady) state probabilities. This shift of paradigms hampers the acceptance of the process algebraic approach by performance modellers. In this paper, we develop an entirely behaviour-oriented analysis technique for stochastic process algebras. The key contribution is an action-based temporal logic to describe behaviours-of-interest, together with a model checking algorithm to derive the probability with which a stochastic process algebra model exhibits a given behaviour-of-interest.


algebraic methodology and software technology | 1999

Bisimulation Algorithms for Stochastic Process Algebras and Their BDD-Based Implementation

Holger Hermanns; Markus Siegle

Stochastic process algebras have been introduced in order to enable compositional performance analysis. The size of the state space is a limiting factor, especially if the system consists of many cooperating components. To fight state space explosion, various proposals for compositional aggregation have been made. They rely on minimisation with respect to a congruence relation. This paper addresses the computational complexity of minimisation algorithms and explains how efficient, BDD-based data structures can be employed for this purpose.


dependable systems and networks | 2004

Model checking action- and state-labelled Markov chains

Christel Baier; Lucia Cloth; Boudewijn R. Haverkort; Matthias Kuntz; Markus Siegle

In this paper we introduce the logic asCSL, an extension of continuous stochastic logic (CSL), which provides powerful means to characterise execution paths of action- and 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 available actions but also on the validity of certain state formulas in intermediate states. Our main result is that the model checking problem for asCSL can be reduced to CSL model checking on a modified Markov chain, which is obtained through a product automaton construction. We provide a case study of a scalable cellular phone system which shows how the logic asCSL and the model checking procedure can be applied in practice.

Collaboration


Dive into the Markus Siegle's collaboration.

Top Co-Authors

Avatar
Top Co-Authors

Avatar

Rainer Klar

University of Erlangen-Nuremberg

View shared research outputs
Top Co-Authors

Avatar

Andreas Quick

University of Erlangen-Nuremberg

View shared research outputs
Top Co-Authors

Avatar

Peter Dauphin

University of Erlangen-Nuremberg

View shared research outputs
Top Co-Authors

Avatar

Richard Hofmann

University of Erlangen-Nuremberg

View shared research outputs
Top Co-Authors

Avatar

Alexander Gouberman

Bundeswehr University Munich

View shared research outputs
Top Co-Authors

Avatar

Bernd Mohr

University of Erlangen-Nuremberg

View shared research outputs
Top Co-Authors

Avatar
Top Co-Authors

Avatar
Top Co-Authors

Avatar

Christel Baier

Dresden University of Technology

View shared research outputs
Researchain Logo
Decentralizing Knowledge