Probabilistic Logical Characterization

Holger Hermanns, Augusto Parma, Roberto Segala, Björn Wachter, Lijun Zhang

    Research output: Contribution to journalJournal articleResearchpeer-review

    Abstract

    Probabilistic automata exhibit both probabilistic and non-deterministic choice. They are therefore a powerful semantic foundation for modeling concurrent systems with random phenomena arising in many applications ranging from artificial intelligence, security, systems biology to performance modeling. Several variations of bisimulation and simulation relations have proved to be useful as means to abstract and compare different automata. This paper develops a taxonomy of logical characterizations of these relations on image-finite and image-infinite probabilistic automata.
    Original languageEnglish
    JournalInformation and Computation
    Volume209
    Issue number2
    Pages (from-to)154-172
    ISSN0890-5401
    DOIs
    Publication statusPublished - 2011

    Keywords

    • Logical characterization
    • Probabilistic automata
    • Simulation
    • Bisimulation

    Fingerprint Dive into the research topics of 'Probabilistic Logical Characterization'. Together they form a unique fingerprint.

    Cite this