Quantitative Evaluation of Systems, International Conference on (2011)
Sept. 5, 2011 to Sept. 8, 2011
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/QEST.2011.28
We recently introduced Abstract Probabilistic Automata (APA), a new powerful abstraction formalism for probabilistic automata. Our theory is equipped with a series of aggressive abstraction techniques for state-space reduction as well as a specification theory for both logical and structural comparisons. This paper reports on the implementation of the approach in the Abstract Probabilistic Automata Checker toolset.
Axel Legay, Benoît Delahaye, Kim G. Larsen, Mikkel L. Pedersen, Andrzej Wasowski, "APAC: A Tool for Reasoning about Abstract Probabilistic Automata", Quantitative Evaluation of Systems, International Conference on, vol. 00, no. , pp. 151-152, 2011, doi:10.1109/QEST.2011.28