The quest for minimal quotients for probabilistic and Markov automata (Q1784955): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: Q5322945 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient CTMC Model Checking of Linear Real-Time Objectives / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algebra of communicating processes with abstraction / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3792231 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4484499 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Semantics of Markov Automata / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the semantics of Markov automata / rank
 
Normal rank
Property / cites work
 
Property / cites work: EQUIVALENCE OF LABELED MARKOV CHAINS / rank
 
Normal rank
Property / cites work
 
Property / cites work: Deciding Bisimilarities on Distributions / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Quest for Minimal Quotients for Probabilistic Automata / 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: Minimizing the number of transitions with respect to observation equivalence / rank
 
Normal rank
Property / cites work
 
Property / cites work: Essential transitions to bisimulation equivalences / rank
 
Normal rank
Property / cites work
 
Property / cites work: Exploring probabilistic bisimulations. I / rank
 
Normal rank
Property / cites work
 
Property / cites work: Automated compositional Markov chain generation for a plain-old telephone system / rank
 
Normal rank
Property / cites work
 
Property / cites work: Probabilistic Bisimulation: Naturally on Distributions / rank
 
Normal rank
Property / cites work
 
Property / cites work: CCS expressions, finite state processes, and three problems of equivalence / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3519383 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3992568 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Three Partition Refinement Algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Probabilistic 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: Probability and Nondeterminism in Operational Models of Concurrency / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4847023 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Polynomial time decision algorithms for probabilistic automata / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Polynomial-Time Algorithm for the Equivalence of Probabilistic Automata / rank
 
Normal rank
Property / cites work
 
Property / cites work: Probabilistic bisimulation for realistic schedulers / rank
 
Normal rank

Revision as of 16:32, 16 July 2024

scientific article
Language Label Description Also known as
English
The quest for minimal quotients for probabilistic and Markov automata
scientific article

    Statements

    The quest for minimal quotients for probabilistic and Markov automata (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    27 September 2018
    0 references
    probabilistic automata
    0 references
    Markov automata
    0 references
    weak probabilistic bisimulation
    0 references
    minimal quotient
    0 references
    decision algorithm
    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