Equivalence of probabilistic \(\mu\)-calculus and p-automata (Q2399249): 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/978-3-319-60134-2_6 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2617530626 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Rudiments of \(\mu\)-calculus / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5322945 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3408862 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The mu-calculus and Model Checking / rank
 
Normal rank
Property / cites work
 
Property / cites work: Probabilistic temporal logics via the modal mu-calculus / rank
 
Normal rank
Property / cites work
 
Property / cites work: Tractable Probabilistic mu-Calculus That Expresses Probabilistic Temporal Logics / rank
 
Normal rank
Property / cites work
 
Property / cites work: Automata, logics, and infinite games. A guide to current research / rank
 
Normal rank
Property / cites work
 
Property / cites work: Automata for the modal μ-calculus and related results / rank
 
Normal rank
Property / cites work
 
Property / cites work: Results on the propositional \(\mu\)-calculus / rank
 
Normal rank
Property / cites work
 
Property / cites work: An automata-theoretic approach to branching-time model checking / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the equivalence of game and denotational semantics for the probabilistic mu-calculus / rank
 
Normal rank
Property / cites work
 
Property / cites work: Probabilistic modal {\mu}-calculus with independent product / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fixed point characterization of infinite behavior of finite-state systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Alternating tree automata, parity games, and modal \(\mu\)-calculus / rank
 
Normal rank

Latest revision as of 06:52, 14 July 2024

scientific article
Language Label Description Also known as
English
Equivalence of probabilistic \(\mu\)-calculus and p-automata
scientific article

    Statements

    Identifiers

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