sigref
| project staff | description | benchmarks | publications
|
Chair of Computer Architecture | |
Ralf Wimmer, Dr. | developer / contact |
Sigref is a tool for the minimization of different classes of finite state models, namely
- labeled transition systems (LTSs),
- discrete-time Markov chains (DTMCs),
- continuous-time Markov chains (CTMCs), and
- interactive Markov chains (IMCs)
with respect to a number of bisimulations like strong, weak, and branching bisimulation. For the minimization of CTMCs, it supports - besides the standard floating point arithmetic - the usage of exact arithmetic and the handling of transition rates as symbolic parameters. Furthermore there is a variant of sigref which uses two different partition representations and an automatic conversion in order to keep the memory consumption within the user-specified limit.
Cyclic polling server (*)
Grid-world robot (*)
ETCS (**)
Kanban production system (*)
Milner scheduler (**)
Work station cluster (*)
P2P network (*)
Fibroblast growth factor signalling (*)
Cell cycle control (*)
(*) http://www.prismmodelchecker.org/casestudies/index.php
(**) http://www.avacs.org
Ralf Wimmer, Marc Herbstritt, Holger Hermanns, Kelley Strampp, Bernd Becker Sigref - A symbolic bisimulation tool box Int'l Symposium on Automated Technology for Verification and Analysis, 2006 |
Ralf Wimmer, Bernd Becker Correctness issues of symbolic bisimulation computation for Markov chains Int'l GI/ITG Conference on Measurement, Modelling and Evaluation of Computing Systems, 2010 |
Ralf Wimmer, Salem Derisavi, Holger Hermanns Symbolic partition refinement with automatic balancing of time and space Performance Evaluation, 67(9):815--835, 2010 |