Name
Abstract | ||
|---|---|---|
Probabilistic Automata (PAs) are a widely-recognized mathematical framework for the specification and analysis of systems
with non-deterministic and stochastic behaviors. This paper proposes Abstract Probabilistic Automata (APAs), that is a novel
abstraction model for PAs. In APAs uncertainty of the non-deterministic choices is modeled by may/must modalities on transitions
while uncertainty of the stochastic behaviour is expressed by (underspecified) stochastic constraints. We have developed a
complete abstraction theory for PAs, and also propose the first specification theory for them. Our theory supports both satisfaction
and refinement operators, together with classical stepwise design operators. In addition, we study the link between specification
theories and abstraction in avoiding the state-space explosion problem.
|
Year | DOI | Venue |
|---|---|---|
2013 | 10.1007/978-3-642-18275-4_23 | Inf. Comput. |
Keywords | Field | DocType |
abstract probabilistic automata,novel abstraction model,stochastic constraint,stochastic behaviour,stochastic behavior,probabilistic automata,complete abstraction theory,apas uncertainty,abstract probabilistic automaton,specification theory,non-deterministic choice | Quantum finite automata,Discrete mathematics,Abstraction,Computer science,Theoretical computer science,Operator (computer programming),Probabilistic automaton | Journal |
Volume | ISSN | Citations |
232 | 0890-5401 | 14 |
PageRank | References | Authors |
0.65 | 23 | 7 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Benoît Delahaye | 1 | 266 | 15.59 |
| Joost-Pieter Katoen | 2 | 4444 | 289.65 |
| Kim G. Larsen | 3 | 3922 | 254.03 |
| Axel Legay | 4 | 2982 | 181.47 |
| Mikkel L. Pedersen | 5 | 64 | 3.78 |
| Falak Sher | 6 | 23 | 1.47 |
| Andrzej Wasowski | 7 | 1282 | 60.47 |