Symbolic calculation of k-shortest paths and related measures with the stochastic process algebra tool CASPA

Authors:
Michael Günther;Johann Schuster;Markus Siegle
Affiliations:
Universität der Bundeswehr, München;Universität der Bundeswehr, München;Universität der Bundeswehr, München
Venue:
Proceedings of the First Workshop on DYnamic Aspects in DEpendability Models for Fault-Tolerant Systems
Year:
2010

Citing 0
Cited 2

Counterexample generation for Markov chains using SMT-based bounded model checking

FMOODS'11/FORTE'11 Proceedings of the joint 13th IFIP WG 6.1 and 30th IFIP WG 6.1 international conference on Formal techniques for distributed systems
Minimal critical subsystems for discrete-time markov models

TACAS'12 Proceedings of the 18th international conference on Tools and Algorithms for the Construction and Analysis of Systems

Quantified Score

Hi-index	0.00

Visualization

Abstract

CASPA is a stochastic process algebra tool for performance and dependability modelling, analysis and verification. It is based entirely on the symbolic data structure MTBDD (multi-terminal binary decision diagram) which enables the tool to handle models with very large state space. This paper describes an extension of CASPA's solving engine for path-based analysis. We present a symbolic variant of the k-shortest-path algorithm of Azevedo, which works in conjunction with a symbolic variant of Dijkstra's shortest path algorithm. A non-trivial case study illustrates the use of this kind of path-based analysis.