Deciding probabilistic bisimilarity over infinite-state probabilistic systems (Q2482725): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
(2 intermediate revisions by 2 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.1007/s00236-007-0066-8 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2020335855 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4536611 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Verification of probabilistic systems with faulty communication / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4417850 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4518905 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the consistency of Koomen's fair abstraction rule / rank
 
Normal rank
Property / cites work
 
Property / cites work: A note on the attractor-property of infinite-state Markov chains / rank
 
Normal rank
Property / cites work
 
Property / cites work: Probabilistic weak simulation is decidable in polynomial time / rank
 
Normal rank
Property / cites work
 
Property / cites work: Model checking of probabilistic and nondeterministic systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: FSTTCS 2005: Foundations of Software Technology and Theoretical Computer Science / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2760246 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4484499 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The complexity of probabilistic verification / rank
 
Normal rank
Property / cites work
 
Property / cites work: Tools and Algorithms for the Construction and Analysis of Systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: STACS 2005 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A logic for reasoning about time and reliability / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2760248 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4673421 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bisimulation through probabilistic testing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4449237 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4847023 / rank
 
Normal rank

Latest revision as of 21:09, 27 June 2024

scientific article
Language Label Description Also known as
English
Deciding probabilistic bisimilarity over infinite-state probabilistic systems
scientific article

    Statements

    Deciding probabilistic bisimilarity over infinite-state probabilistic systems (English)
    0 references
    0 references
    0 references
    0 references
    23 April 2008
    0 references
    probabilistic pushdown automata
    0 references
    finite-state systems
    0 references

    Identifiers