Academic
Publications
New Results on Abstract Probabilistic Automata
New Results on Abstract Probabilistic Automata   (Citations: 2)
BibTex | RIS | RefWorks Download
Probabilistic Automata (PAs) are a recognized framework for modeling and analysis of nondeterministic sys- tems 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.
Cumulative Annual
View Publication
The following links allow you to view full publications. These links are maintained by other sources not affiliated with Microsoft Academic Search.
    • ...This extension adds must self-loops for all new actions and extends the sets of atomic propositions in a classical way. See [18] for a formal definition...
    • ...Following the presentation in [23] it is possible to express an arbitrary inteface automaton as an abstract probabilistic automaton. We refer to [18] for the translation...

    Benoît Delahayeet al. New Results on Abstract Probabilistic Automata

    • ...Recently [2], [3], we proposed Abstract Probabilistic Automata (APA), a new powerful abstraction formalism for PAs equipped with (1) a series of aggressive abstraction techniques for state-space reduction, and (2) a specification theory for component-based design in the spirit of [4]...
    • ...μ(s3) else. For all distributions μ that satisfies ϕ, μδ will satisfy ϕ � , and for all pairs (s, s � ) such that δ(s)(s � ) > 0, s R s � . Details can be found in [2], [3]...

    Benoît Delahayeet al. APAC: A Tool for Reasoning about Abstract Probabilistic Automata

Order by: