A Symbolic Multilevel Method with Sparse Submatrix Representation for Memory-Speed-Tradeoff. - Johann Schuster; Markus Siegle (MMB, 2008)

Recent Extensions to the Stochastic Process Algebra Tool CASPA. - Martin Riedl 001; Johann Schuster; Markus Siegle (QEST, 2008)

A view-probability-matrix approach to the modelling of gossiping protocols. - Thomas Krieger; Martin Riedl 001; Johann Schuster; Markus Siegle (SIGMETRICS Perform. Evaluation Rev., 2008)

An Efficient Symbolic Elimination Algorithm for the Stochastic Process Algebra Tool CASPA. - Jens Bachmann; Martin Riedl 001; Johann Schuster; Markus Siegle (SOFSEM, 2009)

Symbolic calculation of k-shortest paths and related measures with the stochastic process algebra tool CASPA. - Michael Günther 008; Johann Schuster; Markus Siegle (DYADEM-FTS@EDCC, 2010)

Dependability modelling with the stochastic process algebra tool CASPA. - Johann Schuster; Markus Siegle (DYADEM-FTS@EDCC, 2010)

Scale-Freeness of SPA Models with Weighted Immediate Actions. - Johann Schuster; Markus Siegle (EPEW/UKPEW, 2012)

Symbolic Counterexample Generation for Discrete-Time Markov Chains. - Nils Jansen 001; Erika Ábrahám; Barna Zajzon; Ralf Wimmer 001; Johann Schuster; Joost-Pieter Katoen; Bernd Becker 001 (FACS, 2012)

A Modelling and Analysis Environment for LARES. - Alexander Gouberman; Martin Riedl 001; Johann Schuster; Markus Siegle (MMB/DFT, 2012)

Towards faster numerical solution of Continuous Time Markov Chains stored by symbolic data structures. - Johann Schuster (Verlag Dr. Hut, 2012)

The Quest for Minimal Quotients for Probabilistic Automata. - Christian Eisentraut; Holger Hermanns; Johann Schuster; Andrea Turrini; Lijun Zhang 001 (TACAS, 2013)

Lattice structures for bisimilar Probabilistic Automata. - Johann Schuster; Markus Siegle (INFINITY, 2013)

Some notes on the abstraction operation for multi-terminal binary decision diagrams. - Ludwig Griebl; Johann Schuster (Formal Methods Syst. Des., 2014)

Markov Automata: Deciding weak bisimulation by means of non-naïvely vanishing states. - Johann Schuster; Markus Siegle (Inf. Comput., 2014)

Symbolic counterexample generation for large discrete-time Markov chains. - Nils Jansen 001; Ralf Wimmer 001; Erika Ábrahám; Barna Zajzon; Joost-Pieter Katoen; Bernd Becker 001; Johann Schuster (Sci. Comput. Program., 2014)

The quest for minimal quotients for probabilistic and Markov automata. - Christian Eisentraut; Holger Hermanns; Johann Schuster; Andrea Turrini; Lijun Zhang 001 (Inf. Comput., 2018)