Algorithmic bisimulation for communicating piecewise deterministic Markov processes

S.N. Strubbe, Arjan van der Schaft

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

    17 Downloads (Pure)

    Abstract

    In this paper we present an algorithm for finding a bisimulation relation for stochastic hybrid systems from the class of CPDPs (Communicating Piecewise Deterministic Markov Processes). We prove that the fixed point of the algorithm forms a bisimulation on the state space of the CPDP. We give sufficient conditions on the continuous dynamics and the transition structure of a CPDP, for the computation of the algorithm to be decidable.
    Original languageEnglish
    Title of host publicationProceedings of the 44th IEEE Conference on Decision and Control and the 2005 European Control Conference (CDC-ECC '05)
    PublisherIEEE
    Pages6109-6114
    Number of pages6
    ISBN (Print)0-7803-9568-9
    DOIs
    Publication statusPublished - Dec 2005
    Event44th Conference on Decision and Control, and 2005 European Control Conference, CDC-ECC 2005 - Melia Seville, Seville, Spain
    Duration: 12 Dec 200515 Dec 2005
    Conference number: 44

    Publication series

    NameProceedings of the IEEE Conference on Decision and Control
    PublisherIEEE
    Volume2005
    ISSN (Print)0191-2216

    Conference

    Conference44th Conference on Decision and Control, and 2005 European Control Conference, CDC-ECC 2005
    Abbreviated titleCDC-ECC
    CountrySpain
    CitySeville
    Period12/12/0515/12/05

    Keywords

    • Communicating Piecewise Deterministic Markov Processes (CPDPs)

    Fingerprint Dive into the research topics of 'Algorithmic bisimulation for communicating piecewise deterministic Markov processes'. Together they form a unique fingerprint.

    Cite this