Name
Abstract | ||
|---|---|---|
In recent papers, the partial order reduction approach has been adapted to reason about the probabilities for temporal properties in concurrent systems with probabilistic behaviours. This paper extends these results by presenting reduction criteria for a probabilistic branching time logic that allows specification of constraints on quantitative measures given by a reward or cost function for the actions of the system. |
Year | DOI | Venue |
|---|---|---|
2006 | 10.1007/11944836_29 | FSTTCS |
Keywords | Field | DocType |
partial order reduction,cost function | Discrete mathematics,Mathematical optimization,Computer science,Concurrency,Reduction criterion,Markov decision process,Artificial intelligence,Partial order reduction,Probabilistic logic,Probabilistic relevance model,Partially ordered set,Branching (version control) | Conference |
Volume | ISSN | ISBN |
4337 | 0302-9743 | 3-540-49994-6 |
Citations | PageRank | References |
2 | 0.37 | 28 |
Authors | ||
6 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Marcus Größer | 1 | 334 | 18.23 |
| Gethin Norman | 2 | 4163 | 193.68 |
| Christel Baier | 3 | 3053 | 185.85 |
| Frank Ciesinski | 4 | 299 | 14.52 |
| Marta Z. Kwiatkowska | 5 | 6118 | 322.21 |
| David Parker | 6 | 4018 | 184.00 |