Markov automata: deciding weak bisimulation by means of non-naïvely vanishing states (Q2252526): 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 / OpenAlex ID
 
Property / OpenAlex ID: W1971346686 / rank
 
Normal rank
Property / arXiv ID
 
Property / arXiv ID: 1205.6192 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4835250 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4484499 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Deciding Probabilistic Automata Weak Bisimulation in Polynomial Time / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Semantics of Markov Automata / rank
 
Normal rank
Property / cites work
 
Property / cites work: Markov automata: deciding weak bisimulation by means of non-naïvely vanishing states / rank
 
Normal rank
Property / cites work
 
Property / cites work: Deciding Bisimilarities on Distributions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Improving Time Bounded Reachability Computations in Interactive Markov Chains / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3519383 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Concurrency and Composition in a Stochastic World / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4847023 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Quest for Minimal Quotients for Probabilistic Automata / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 18:12, 8 July 2024

scientific article
Language Label Description Also known as
English
Markov automata: deciding weak bisimulation by means of non-naïvely vanishing states
scientific article

    Statements

    Markov automata: deciding weak bisimulation by means of non-naïvely vanishing states (English)
    0 references
    0 references
    0 references
    18 July 2014
    0 references
    Markov automata
    0 references
    weak bisimulation
    0 references
    vanishing state
    0 references
    elimination
    0 references

    Identifiers

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