Abstract
| Original language | Undefined |
|---|---|
| Title of host publication | Proceedings of the 2nd Young Researchers Workshop on Concurrency Theory |
| Place of Publication | Eindhoven, The Netherlands |
| Publisher | Eindhoven University of Technology |
| Pages | 87-90 |
| Number of pages | 4 |
| ISBN (Print) | not assigned |
| Publication status | Published - Sep 2010 |
Publication series
| Name | |
|---|---|
| Publisher | Eindhoven University of Technology |
Keywords
- IR-76537
- METIS-275960
- Probabilistic automata
- State space reduction
- EC Grant Agreement nr.: FP7-ICT-2007-1
- Branching probabilistic bisimulation
- Confluence
- EWI-19883
- EC Grant Agreement nr.: FP7/214755
- Probabilistic process algebra
Cite this
}
Confluence reduction for probabilistic systems. / Timmer, Mark; van de Pol, Jan Cornelis; Stoelinga, Mariëlle Ida Antoinette.
Proceedings of the 2nd Young Researchers Workshop on Concurrency Theory. Eindhoven, The Netherlands : Eindhoven University of Technology, 2010. p. 87-90.Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › Academic › peer-review
TY - GEN
T1 - Confluence reduction for probabilistic systems
AU - Timmer, Mark
AU - van de Pol, Jan Cornelis
AU - Stoelinga, Mariëlle Ida Antoinette
N1 - eemcs-eprint-19883
PY - 2010/9
Y1 - 2010/9
N2 - In this presentation we introduce a novel technique for state space reduction of probabilistic specifications, based on a newly developed notion of confluence for probabilistic automata. We proved that this reduction preserves branching probabilistic bisimulation and can be applied on-the-fly. To support the technique, we introduce a method for detecting confluent transitions in the context of a probabilistic process algebra with data, facilitated by an earlier defined linear format. We present a case study, demonstrating that significant reductions can be obtained.
AB - In this presentation we introduce a novel technique for state space reduction of probabilistic specifications, based on a newly developed notion of confluence for probabilistic automata. We proved that this reduction preserves branching probabilistic bisimulation and can be applied on-the-fly. To support the technique, we introduce a method for detecting confluent transitions in the context of a probabilistic process algebra with data, facilitated by an earlier defined linear format. We present a case study, demonstrating that significant reductions can be obtained.
KW - IR-76537
KW - METIS-275960
KW - Probabilistic automata
KW - State space reduction
KW - EC Grant Agreement nr.: FP7-ICT-2007-1
KW - Branching probabilistic bisimulation
KW - Confluence
KW - EWI-19883
KW - EC Grant Agreement nr.: FP7/214755
KW - Probabilistic process algebra
M3 - Conference contribution
SN - not assigned
SP - 87
EP - 90
BT - Proceedings of the 2nd Young Researchers Workshop on Concurrency Theory
PB - Eindhoven University of Technology
CY - Eindhoven, The Netherlands
ER -