Expressiveness of probabilistic modal logics: a gradual approach (Q2417857): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: Q4112980 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4836494 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bisimulation and cocongruence for probabilistic systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bisimulation for labelled Markov processes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximating labelled Markov processes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Metrics for labelled Markov processes / 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: Bisimulation for probabilistic transition systems: A coalgebraic approach / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3274458 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3883467 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algebraic laws for nondeterminism and concurrency / rank
 
Normal rank
Property / cites work
 
Property / cites work: Exemplaric Expressivity of Modal Logics / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4323294 / rank
 
Normal rank
Property / cites work
 
Property / cites work: (Metric) Bisimulation Games and Real-Valued Modal Logics for Coalgebras / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bisimulation through probabilistic testing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3619416 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Unprovability of the logical characterization of bisimulation / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Complexity of Computing a Bisimilarity Pseudometric on Probabilistic Automata / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2760238 / rank
 
Normal rank

Revision as of 09:52, 19 July 2024

scientific article
Language Label Description Also known as
English
Expressiveness of probabilistic modal logics: a gradual approach
scientific article

    Statements

    Expressiveness of probabilistic modal logics: a gradual approach (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    29 May 2019
    0 references
    labelled Markov process
    0 references
    probabilistic bisimulation
    0 references
    probabilistic simulation
    0 references
    probabilistic modal logic
    0 references
    analytic set
    0 references
    Polish space
    0 references

    Identifiers

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