The quest for minimal quotients for probabilistic and Markov automata (Q1784955)

From MaRDI portal
Revision as of 22:29, 14 September 2024 by Daniel (talk | contribs) (‎Created claim: Wikidata QID (P12): Q129270202, #quickstatements; #temporary_batch_1726345393210)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
The quest for minimal quotients for probabilistic and Markov automata
scientific article

    Statements

    title
    The quest for minimal quotients for probabilistic and Markov automata (English)
    0 references
    author
    Christian Eisentraut
    0 references
    Holger Hermanns
    0 references
    Johann Schuster
    0 references
    Andrea Turrini
    0 references
    Li-jun Zhang
    0 references
    publication date
    27 September 2018
    0 references
    zbMATH Keywords
    probabilistic automata
    0 references
    Markov automata
    0 references
    weak probabilistic bisimulation
    0 references
    minimal quotient
    0 references
    decision algorithm
    0 references
    describes a project that uses
    PRISM
    0 references
    z3
    0 references
    cites work
    Q5322945
    0 references
    Q3792231
    0 references
    Q4484499
    0 references
    Q3519383
    0 references
    Q3992568
    0 references
    Probabilistic automata
    0 references
    Q4847023
    0 references

    Identifiers

    Mathematics Subject Classification ID
    68Q85
    0 references
    68Q45
    0 references
    68Q60
    0 references
    68Q87
    0 references
    zbMATH DE Number
    6944938
    0 references
    OpenAlex ID
    W2889143140
    0 references
    Wikidata QID
    Q129270202
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q1784955&oldid=37840461"
    Powered by MediaWiki