Bisimulation for communicating piecewise deterministic Markov processes (CPDP's)

S.N. Strubbe, Arjan van der Schaft

    Research output: Chapter in Book/Report/Conference proceedingChapterAcademicpeer-review

    17 Citations (Scopus)

    Abstract

    CPDPs (Communicating Piecewise Deterministic Markov Processes) can be used for compositional specification of systems from the class of stochastic hybrid processes formed by PDPs (Piecewise Deterministic Markov Processes). We define CPDPs and the composition of CPDPs, and prove that the class of CPDPs is closed under composition. Then we introduce a notion of bisimulation for PDPs and CPDPs and we prove that bisimilar PDPs as well as bisimilar CPDPs have equal stochastic behavior. Finally, as main result, we prove the congruence property that, for a composite CPDP, substituting components by different but bisimilar components results in a CPDP that is bisimilar to the original composite CPDP (and therefore has equal stochastic behavior). © Springer-Verlag Berlin Heidelberg 2005.
    Original languageUndefined
    Title of host publicationHybrid Systems: Computation and Control
    EditorsM. Morari, L. Thiele
    Place of PublicationBerlin
    PublisherSpringer
    Pages623-639
    Number of pages17
    ISBN (Print)978-3-540-25108-8
    DOIs
    Publication statusPublished - 2005

    Publication series

    NameLecture Notes in Computer Science
    PublisherSpringer Verlag
    Number3414
    Volume3414
    ISSN (Print)0302-9743

    Keywords

    • IR-69166
    • METIS-228028
    • EWI-16849

    Cite this