Faster algorithms for quantitative verification in bounded treewidth graphs (Q2058390): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Formalizing and Reasoning about Quality / rank
 
Normal rank
Property / cites work
 
Property / cites work: Regular Functions and Cost Register Automata / rank
 
Normal rank
Property / cites work
 
Property / cites work: Synthesizing robust systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Two-way cost automata and cost logics over infinite trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4291429 / rank
 
Normal rank
Property / cites work
 
Property / cites work: SOFSEM 2005: Theory and Practice of Computer Science / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parallel algorithms with optimal speedup for bounded treewidth / rank
 
Normal rank
Property / cites work
 
Property / cites work: Pebble Weighted Automata and Weighted Logics / rank
 
Normal rank
Property / cites work
 
Property / cites work: Infinite Runs in Weighted Timed Automata with Energy Constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: Averaging in LTL / rank
 
Normal rank
Property / cites work
 
Property / cites work: New methods for deriving joint probability distributions of structure factors. I / rank
 
Normal rank
Property / cites work
 
Property / cites work: Quantitative abstraction refinement / rank
 
Normal rank
Property / cites work
 
Property / cites work: Quantitative languages / rank
 
Normal rank
Property / cites work
 
Property / cites work: Faster algorithms for quantitative verification in constant treewidth graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithms for algebraic path properties in concurrent systems of constant treewidth components / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximating the minimum cycle mean / rank
 
Normal rank
Property / cites work
 
Property / cites work: Faster Algorithms for Algebraic Path Properties in Recursive State Machines with Constant Treewidth / rank
 
Normal rank
Property / cites work
 
Property / cites work: Quantitative Interprocedural Analysis / rank
 
Normal rank
Property / cites work
 
Property / cites work: Shortest paths in digraphs of small treewidth. I: Sequential algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: The monadic second-order logic of graphs. I: Recognizable sets of finite graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Handbook of weighted automata / rank
 
Normal rank
Property / cites work
 
Property / cites work: Weighted automata and weighted MSO logics for average and long-time behaviors / rank
 
Normal rank
Property / cites work
 
Property / cites work: Quantitative Languages Defined by Functional Automata / rank
 
Normal rank
Property / cites work
 
Property / cites work: Quantitative Multi-objective Verification for Probabilistic Systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4707790 / rank
 
Normal rank
Property / cites work
 
Property / cites work: S-functions for graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finding minimum cost to time ratio cycles with small integral transit times / rank
 
Normal rank
Property / cites work
 
Property / cites work: From Model Checking to Model Measuring / rank
 
Normal rank
Property / cites work
 
Property / cites work: A characterization of the minimum cycle mean in a digraph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Quantitative Monadic Second-Order Logic / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal search for rationals / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3048571 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computer Aided Verification / rank
 
Normal rank
Property / cites work
 
Property / cites work: New scaling algorithms for the assignment and minimum mean cycle problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient search for rationals / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graph minors. III. Planar tree-width / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graph minors. II. Algorithmic aspects of tree-width / rank
 
Normal rank
Property / cites work
 
Property / cites work: Depth-First Search and Linear Graph Algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: All structured programs have small tree width and good register allocation / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Complexity of Mean-Payoff Automaton Expression / rank
 
Normal rank

Latest revision as of 10:11, 27 July 2024

scientific article
Language Label Description Also known as
English
Faster algorithms for quantitative verification in bounded treewidth graphs
scientific article

    Statements

    Faster algorithms for quantitative verification in bounded treewidth graphs (English)
    0 references
    0 references
    0 references
    0 references
    8 December 2021
    0 references
    quantitative verification
    0 references
    minimum mean cycle
    0 references
    minimum ratio cycle
    0 references
    constant treewidth graphs
    0 references
    initial credit for energy
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers