New Results on Abstract Probabilistic Automata

Authors:
Benoît Delahaye;Joost-Pieter Katoen;Kim G. Larsen;Axel Legay;Mikkel L. Pedersen;Falak Sher;Andrzej Wasowski
Affiliations:
-;-;-;-;-;-;-
Venue:
ACSD '11 Proceedings of the 2011 Eleventh International Conference on Application of Concurrency to System Design
Year:
2011

Citing 0
Cited 3

Compositional abstraction techniques for probabilistic automata

TCS'12 Proceedings of the 7th IFIP TC 1/WG 202 international conference on Theoretical Computer Science
Refinement and difference for probabilistic automata

QEST'13 Proceedings of the 10th international conference on Quantitative Evaluation of Systems
Abstract Probabilistic Automata

Information and Computation

Quantified Score

Hi-index	0.00

Visualization

Abstract

Probabilistic Automata (PAs) are a recognized framework for modeling and analysis of nondeterministic systems with stochastic behavior. Recently, we proposed Abstract Probabilistic Automata (APAs) -- an abstraction framework for PAs. In this paper, we discuss APAs over dissimilar alphabets, a determinisation operator, conjunction of non-deterministic APAs, and an APA-embedding of Interface Automata. We conclude introducing a tool for automatic manipulation of APAs.