Confluence reduction for probabilistic systems

    Research output: Chapter in Book/Report/Conference proceedingConference contributionAcademicpeer-review

    43 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 languageUndefined
    Title of host publicationProceedings of the 2nd Young Researchers Workshop on Concurrency Theory
    Place of PublicationEindhoven, The Netherlands
    PublisherEindhoven University of Technology
    Pages87-90
    Number of pages4
    ISBN (Print)not assigned
    Publication statusPublished - Sep 2010

    Publication series

    Name
    PublisherEindhoven 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