Comparative branching-time semantics for Markov chains (Q2387196): Difference between revisions

From MaRDI portal
RedirectionBot (talk | contribs)
Removed claim: author (P16): Item:Q236073
Normalize DOI.
 
(6 intermediate revisions by 5 users not shown)
Property / DOI
 
Property / DOI: 10.1016/j.ic.2005.03.001 / rank
Normal rank
 
Property / author
 
Property / author: Joost-Pieter Katoen / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2115555017 / rank
 
Normal rank
Property / Wikidata QID
 
Property / Wikidata QID: Q57801888 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The existence of refinement mappings / rank
 
Normal rank
Property / cites work
 
Property / cites work: Temporal logics for the specification of performance and reliability / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2769588 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Model-checking continuous-time Markov chains / 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: Probabilistic weak simulation is decidable in polynomial time / 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: Q4270055 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5137353 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Extended Markovian Process Algebra / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4536610 / 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: Three logics for branching bisimulation / 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: Approximating labelled Markov processes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4484498 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Continuous stochastic logic characterizes bisimulation of continuous-time Markov processes. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2760238 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Reactive, generative, and stratified models of probabilistic processes / 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: The Randomization Technique as a Modeling Tool and Solution Procedure for Transient Markov Processes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5538132 / 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: Q4252730 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Interactive Markov chains. And the quest for quantified quality / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4032309 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5820901 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3203061 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4798030 / 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: Bisimulation through probabilistic testing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Forward and backward simulations. I. Untimed Systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: A calculus of communicating systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3992568 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3907077 / 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: Q4847023 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4324960 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fun with fireWire: A comparative study of formal verification methods applied to the IEEE 1394 root contention protocol / rank
 
Normal rank
Property / DBLP publication ID
 
Property / DBLP publication ID: journals/iandc/BaierKHW05 / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1016/J.IC.2005.03.001 / rank
 
Normal rank

Latest revision as of 08:21, 18 December 2024

scientific article
Language Label Description Also known as
English
Comparative branching-time semantics for Markov chains
scientific article

    Statements

    Comparative branching-time semantics for Markov chains (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    2 September 2005
    0 references
    Comparative semantics
    0 references
    Markov chain
    0 references
    (weak) Simulation
    0 references
    (weak) Bisimulation
    0 references
    Temporal logic
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references