Can matrix-layout-independent numerical solvers be efficient?: implementing the Moebius state-level abstract functional interface for ZDDs

Authors:
K. Lampka;S. Harwarth;M. Siegle
Affiliations:
University of the Federal Armed Forces, Munich, Germany;University of the Federal Armed Forces, Munich, Germany;University of the Federal Armed Forces, Munich, Germany
Venue:
Proceedings of the 2nd international conference on Performance evaluation methodologies and tools
Year:
2007

Citing 16
Cited 0

Graph-Based Algorithms for Boolean Function Manipulation

IEEE Transactions on Computers
Zero-suppressed BDDs for set manipulation in combinatorial problems

DAC '93 Proceedings of the 30th international Design Automation Conference
A decomposition approach for stochastic reward net models

Performance Evaluation
On the stochastic structure of parallelism and synchronization models for distributed algorithms
Introduction to the Special Issue on Multi-Terminal BinaryDecision Diagrams

Formal Methods in System Design
The Möbius Framework and Its Implementation

IEEE Transactions on Software Engineering
The Möbius State-Level Abstract Functional Interface

TOOLS '02 Proceedings of the 12th International Conference on Computer Performance Evaluation, Modelling Techniques and Tools
Exploiting Symmetries in Stochastic Process Algebras

Proceedings of the 12th European Simulation Multiconference on Simulation - Past, Present and Future
On the Efficient Sequential and Distributed Generation of Very Large Markov Chains from Stochastic Petri Nets

PNPM '99 Proceedings of the The 8th International Workshop on Petri Nets and Performance Models
ON THE USE OF KRONECKER OPERATORS FOR THE SOLUTION OF GENERALIZED STOCHASTIC PETRI NETS

ON THE USE OF KRONECKER OPERATORS FOR THE SOLUTION OF GENERALIZED STOCHASTIC PETRI NETS
Generating BDDs for symbolic model checking in CCS

Distributed Computing
Approximate Analysis of Stochastic Models by Self-Correcting Aggregation

QEST '05 Proceedings of the Second International Conference on the Quantitative Evaluation of Systems
Analysis of Markov reward models using zero-suppressed multi-terminal BDDs

valuetools '06 Proceedings of the 1st international conference on Performance evaluation methodolgies and tools
Structured analysis techniques for large Markov chains

SMCtools '06 Proceeding from the 2006 workshop on Tools for solving structured Markov chains
An easy-to-use, efficient tool-chain to analyze the availability of telecommunication equipment

FMICS'06/PDMC'06 Proceedings of the 11th international workshop, FMICS 2006 and 5th international workshop, PDMC conference on Formal methods: Applications and technology
A symbolic algorithm for optimal Markov chain lumping

TACAS'07 Proceedings of the 13th international conference on Tools and algorithms for the construction and analysis of systems

Quantified Score

Hi-index	0.00

Visualization

Abstract

Symbolic approaches based on decision diagrams have shown to be well suited for representing very large continuous-time Markov chains (CTMC), as derived from high-level model descriptions. Unfortunately, each type of decision diagram requires its own implementation of the numerical solvers for computing the state probabilities of the CTMC. For this reason, some time ago the idea of separating numerical solution methods from the representation of the CTMC was proposed [12], suggesting the implementation of a so-called state-level abstract functional interface (AFI), which defines classes of iterators for accessing the entries of the CTMC transition rate matrix. In this paper we (a) present an implementation of the AFI for zero-suppressed multi-terminal binary decision diagrams (ZDDs) [18] and (b) empirically investigate the viability of matrix-layout-independent implementations of numerical solvers.