Parametric Markov chains: PCTL complexity and fraction-free Gaussian elimination (Q2182734): Difference between revisions

From MaRDI portal
RedirectionBot (talk | contribs)
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
(8 intermediate revisions by 4 users not shown)
Property / describes a project that uses
 
Property / describes a project that uses: PRISM / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: Eigen / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: PARAM / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: PROPhESY / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: Storm / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2995644129 / rank
 
Normal rank
Property / arXiv ID
 
Property / arXiv ID: 1709.02093 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Theoretical Aspects of Computing - ICTAC 2004 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parametric probabilistic transition systems for system design and analysis / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computational Solutions of Matrix Problems Over an Integral Domain / rank
 
Normal rank
Property / cites work
 
Property / cites work: A logic for reasoning about time and reliability / rank
 
Normal rank
Property / cites work
 
Property / cites work: Tools and Algorithms for the Construction and Analysis of Systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Model-Checking ω-Regular Properties of Interval Markov Chains / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3384160 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Exact Solution of Systems of Linear Equations with Polynomial Coefficients / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solving systems of linear equations over polynomials / rank
 
Normal rank
Property / cites work
 
Property / cites work: An algorithm for solving parametric linear systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: LTL Model Checking of Interval Markov Chains / rank
 
Normal rank
Property / cites work
 
Property / cites work: Reachability in augmented interval Markov chains / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parameter synthesis for Markov models: faster than ever / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sequential Convex Programming for the Efficient Verification of Parametric MDPs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4864760 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5322945 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Probabilistic self-stabilization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Probabilistic verification of Herman's self-stabilisation algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: The complexity of elementary algebra and geometry / rank
 
Normal rank

Latest revision as of 18:58, 22 July 2024

scientific article
Language Label Description Also known as
English
Parametric Markov chains: PCTL complexity and fraction-free Gaussian elimination
scientific article

    Statements

    Parametric Markov chains: PCTL complexity and fraction-free Gaussian elimination (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    26 May 2020
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    parametric Markov chain
    0 references
    parametric model checking
    0 references
    Gaussian elimination
    0 references
    PCTL
    0 references
    computational complexity
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references