DocumentCode
3643132
Title
New Results on Abstract Probabilistic Automata
Author
Benoît Delahaye;Joost-Pieter Katoen;Kim G. Larsen;Axel Legay;Mikkel L. Pedersen;Falak Sher;Andrzej Wasowski
Author_Institution
IRISA, INRIA, Rennes, France
fYear
2011
fDate
6/1/2011 12:00:00 AM
Firstpage
118
Lastpage
127
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.
Keywords
"Automata","Probabilistic logic","Markov processes","Labeling","Probability distribution","Junctions"
Publisher
ieee
Conference_Titel
Application of Concurrency to System Design (ACSD), 2011 11th International Conference on
ISSN
1550-4808
Print_ISBN
978-1-61284-974-4
Type
conf
DOI
10.1109/ACSD.2011.10
Filename
5988924
Link To Document