Skip to main navigation Skip to search Skip to main content

YMCA: Why Markov Chain Algebra?

    Research output: Chapter in Book/Report/Conference proceedingConference contributionAcademic

    9 Downloads (Pure)

    Abstract

    Markov chains are widely used to determine system performance and reliability characteristics. The vast majority of applications considers continuous-time Markov chains (CTMCs). This note motivates how concurrency theory can be extended (as opposed to twisted) to CTMCs. We provide the core motivation for the algebraic setup of Interactive Markov Chains. Therefore, this note should have better been baptized YIMC.
    Original languageEnglish
    Title of host publicationProceedings of the Workshop "Essays on Algebraic Process Calculi" (APC 25)
    Subtitle of host publication1-5 August 2005 • Bertinoro, Italy
    EditorsL. Aceto, A. Gordon
    Place of PublicationAmsterdam
    PublisherElsevier
    Pages107-112
    Number of pages6
    DOIs
    Publication statusPublished - 2006
    EventWorkshop on Algebraic Process Calculi, APC 25: The First Twenty Five Years and Beyond - Bertinoro, Italy
    Duration: 1 Aug 20055 Aug 2005

    Publication series

    NameElectronic Notes in Theoretical Computer Science
    PublisherElsevier
    Number10
    Volume162
    ISSN (Print)1571-0661
    ISSN (Electronic)1571-0661

    Workshop

    WorkshopWorkshop on Algebraic Process Calculi, APC 25
    Country/TerritoryItaly
    CityBertinoro
    Period1/08/055/08/05

    Fingerprint

    Dive into the research topics of 'YMCA: Why Markov Chain Algebra?'. Together they form a unique fingerprint.

    Cite this