The Complexity of Computing a Bisimilarity Pseudometric on Probabilistic Automata (Q5418964): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
(4 intermediate revisions by 3 users not shown)
Property / author
 
Property / author: Franck Van Breugel / rank
Normal rank
 
Property / author
 
Property / author: James Worrell / rank
Normal rank
 
Property / author
 
Property / author: Franck Van Breugel / rank
 
Normal rank
Property / author
 
Property / author: James Worrell / rank
 
Normal rank
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-06880-0_10 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W199912135 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3056948 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On-the-Fly Exact Computation of Bisimilarity Distances / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5322945 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4348453 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2843720 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bisimulation for labelled Markov processes / rank
 
Normal rank
Property / cites work
 
Property / cites work: An introduction to metric semantics: Operational and denotational models for programming and specification languages / rank
 
Normal rank
Property / cites work
 
Property / cites work: On behavioural pseudometrics and closure ordinals / rank
 
Normal rank
Property / cites work
 
Property / cites work: Recursively defined metric spaces without contraction / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4535035 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3165951 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Complexity of Computing Probabilistic Bisimilarity / rank
 
Normal rank
Property / cites work
 
Property / cites work: The complexity of stochastic games / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5365081 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Game Refinement Relations and Metrics / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4270063 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4375489 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Complexity of Nash Equilibria and Other Fixed Points / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computing Game Metrics on Markov Decision Processes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3010463 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3731958 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Introduction to Coalgebra / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3250845 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Reducibility among Fractional Stability Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bisimulation through probabilistic testing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Equilibrium Points of Bimatrix Games / rank
 
Normal rank
Property / cites work
 
Property / cites work: Stochastic Games with Perfect Information and Time Average Payoff / rank
 
Normal rank
Property / cites work
 
Property / cites work: Probability and Computing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3619416 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the complexity of the parity argument and other inefficient proofs of existence / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4222961 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Approximation of Fixed Points of a Continuous Mapping / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3818127 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4847023 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Matrices / rank
 
Normal rank
Property / cites work
 
Property / cites work: Stochastic Games / rank
 
Normal rank
Property / cites work
 
Property / cites work: Modal and temporal properties of processes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5807665 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A lattice-theoretical fixpoint theorem and its applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4499300 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3975934 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computational Aspects of Equilibria / rank
 
Normal rank

Latest revision as of 14:16, 8 July 2024

scientific article; zbMATH DE number 6299333
Language Label Description Also known as
English
The Complexity of Computing a Bisimilarity Pseudometric on Probabilistic Automata
scientific article; zbMATH DE number 6299333

    Statements

    The Complexity of Computing a Bisimilarity Pseudometric on Probabilistic Automata (English)
    0 references
    2 June 2014
    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
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references