On the Complexity of Computing Probabilistic Bisimilarity (Q2892788)

From MaRDI portal
Revision as of 03:45, 20 March 2024 by Openalex240319060354 (talk | contribs) (Set OpenAlex properties.)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
On the Complexity of Computing Probabilistic Bisimilarity
scientific article

    Statements

    title
    On the Complexity of Computing Probabilistic Bisimilarity (English)
    0 references
    author
    Di Chen
    0 references
    Franck Van Breugel
    0 references
    James Worrell
    0 references
    publication date
    22 June 2012
    0 references
    Mathematics Subject Classification ID
    68Q25
    0 references
    60J20
    0 references
    68Q85
    0 references
    68Q87
    0 references
    zbMATH DE Number
    6049313
    0 references
    OpenAlex ID
    W176827812
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q2892788&oldid=33063331"
    Powered by MediaWiki