Taming confusion for modeling and implementing probabilistic concurrent systems

Joost P. Katoen, Doron Peled

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

    9 Citations (Scopus)
    114 Downloads (Pure)


    In concurrent systems, the choice of executing the next transition depends both on the timing between the agents that make independent or collaborative interactions available, and on the conflicts (nondeterministic choices) with other transitions. This creates a challenging modeling and implementation problem. When the system needs to make also probabilistic choices, the situation becomes even more complicated. We use the model of Petri nets to demonstrate the modeling and implementation problem. The proposed solution involves adding sequential observers called agents to the Petri net structure. Distributed probabilistic choices are facilitated in the presence of concurrency and nondeterminism, by selecting agents that make the choices, while guaranteeing that their view is temporarily stable. We provide a distributed scheduling algorithm for implementing a system that allows distributed probabilistic choice.
    Original languageUndefined
    Title of host publicationProceedings of the 22nd European Symposium on Programming (ESOP 2013)
    EditorsMatthias Felleisen, Philippa Gardner
    Place of PublicationLondon
    Number of pages20
    ISBN (Print)978-3-642-37035-9
    Publication statusPublished - Mar 2013
    Event22nd European Symposium on Programming, ESOP 2013 - Rome, Italy
    Duration: 16 Mar 201324 Mar 2013
    Conference number: 22

    Publication series

    NameLecture Notes in Computer Science
    PublisherSpringer Verlag
    ISSN (Print)0302-9743
    ISSN (Electronic)1611-3349


    Conference22nd European Symposium on Programming, ESOP 2013
    Abbreviated titleESOP


    • EC Grant Agreement nr.: FP7/295261
    • EC Grant Agreement nr.: FP7/318490
    • METIS-296392
    • IR-85506
    • EC Grant Agreement nr.: FP7/2007-2013
    • EWI-23248

    Cite this