3 citations · 4 across the 5 of their papers we have counts for
5 papers
Finding Minimal Clusters in st-DAGs
Ulrich Vogl, Markus Siegle
Directed Acylic Graphs with a single entry vertex and a single exit vertex (st-DAGs) have many applications. For instance, they are frequently used for modelling flow problems or p…
Rate Lifting for Stochastic Process Algebra: Exploiting Structural Properties
Markus Siegle, Amin Soltanieh
This report presents an algorithm for determining the unknown rates in the sequential processes of a Stochastic Process Algebra model, provided that the rates in the combined flat…
Rate Reduction for State-labelled Markov Chains with Upper Time-bounded CSL Requirements
Bharath Siva Kumar Tati, Markus Siegle
This paper presents algorithms for identifying and reducing a dedicated set of controllable transition rates of a state-labelled continuous-time Markov chain model. The purpose of…
Lattice structures for bisimilar Probabilistic Automata
Johann Schuster, Markus Siegle
The paper shows that there is a deep structure on certain sets of bisimilar Probabilistic Automata (PA). The key prerequisite for these structures is a notion of compactness of PA.…
Markov Automata: Deciding Weak Bisimulation by means of non-naively Vanishing States
Johann Schuster, Markus Siegle
This paper develops a decision algorithm for weak bisimulation on Markov Automata (MA). For that purpose, different notions of vanishing state (a concept known from the area of Gen…