Confluence reduction for probabilistic systems

Mark Timmer; Jan Cornelis van de Pol; Mariëlle Ida Antoinette Stoelinga

Confluence reduction for probabilistic systems

Mark Timmer, Jan Cornelis van de Pol, Mariëlle Ida Antoinette Stoelinga

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › Academic › peer-review

54 Downloads (Pure)

Abstract

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.

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
Event	2nd Young Researchers Workshop on Concurrency Theory - Paris, France Duration: 4 Sep 2010 → 4 Sep 2010

Publication series

Name
Publisher	Eindhoven University of Technology

Workshop

Workshop	2nd Young Researchers Workshop on Concurrency Theory
Period	4/09/10 → 4/09/10
Other	4 September 2010

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

Access to Document

abstract
open
abstract
open

Cite this

@inproceedings{049e1d0b2cd24a489c460228584ba7f4,

title = "Confluence reduction for probabilistic systems",

abstract = "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.",

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",

author = "Mark Timmer and {van de Pol}, {Jan Cornelis} and Stoelinga, {Mari{\"e}lle Ida Antoinette}",

note = "eemcs-eprint-19883 ; null ; Conference date: 04-09-2010 Through 04-09-2010",

year = "2010",

month = sep,

language = "Undefined",

isbn = "not assigned",

publisher = "Eindhoven University of Technology",

pages = "87--90",

booktitle = "Proceedings of the 2nd Young Researchers Workshop on Concurrency Theory",

}

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

Y2 - 4 September 2010 through 4 September 2010

ER -