Probabilistic weak simulation is decidable in polynomial time (Q1029062): Difference between revisions
From MaRDI portal
Created claim: Wikidata QID (P12): Q57801956, #quickstatements; #temporary_batch_1711574657256 |
ReferenceBot (talk | contribs) Changed an Item |
||
Property / cites work | |||
Property / cites work: Q2769588 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Deciding bisimilarity and similarity for probabilistic processes. / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: CONCUR 2003 - Concurrency Theory / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4484497 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4508289 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q2842864 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Characterizing finite Kripke structures in propositional temporal logic / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Exact and ordinary lumpability in finite Markov chains / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4484499 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Optimal state-space lumping in Markov chains / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4472257 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Branching time and abstraction in bisimulation semantics / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4252730 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4032309 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3203061 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Finite Continuous Time Markov Chains / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4255597 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3992568 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Three Partition Refinement Algorithms / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4217266 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4536612 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4315289 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3818127 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q2771063 / rank | |||
Normal rank |
Latest revision as of 18:03, 1 July 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Probabilistic weak simulation is decidable in polynomial time |
scientific article |
Statements
Probabilistic weak simulation is decidable in polynomial time (English)
0 references
9 July 2009
0 references
algorithms
0 references
computational complexity
0 references
Markov chains
0 references
performance evaluation
0 references
simulation preorder
0 references