On the Complexity of Computing Probabilistic Bisimilarity (Q2892788)

From MaRDI portal
Revision as of 20:33, 3 February 2024 by Import240129110113 (talk | contribs) (Added link to MaRDI item.)
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
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q2892788&oldid=15852474"
    Powered by MediaWiki