Probabilistic weak simulation is decidable in polynomial time (Q1029062): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(4 intermediate revisions by 4 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.ipl.2003.10.001 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2006889545 / rank
 
Normal rank
Property / Wikidata QID
 
Property / Wikidata QID: Q57801956 / rank
 
Normal rank
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
links / mardi / namelinks / mardi / name
 

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
    0 references
    0 references
    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

    Identifiers