Parameterized weighted containment

DOI10.1145/2665076zbMATH Open1354.68145OpenAlexW1966557697MaRDI QIDQ2946752FDOQ2946752

Authors: Guy Avni, Orna Kupferman 

Publication date: 17 September 2015

Published in: ACM Transactions on Computational Logic (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/2665076

Recommendations

• Parameterized Weighted Containment
• Making weighted containment feasible: a heuristic based on simulation and abstraction
• Quantitative Languages
• Quantitative languages
• The inclusion problem for weighted automata on infinite trees

zbMATH Keywords

weighted automataquantitative verificationellipsoid methodpartially specified systems

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Specification and verification (program logics, model checking, etc.) (68Q60)

Cites Work

• The ellipsoid method and its consequences in combinatorial optimization
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Algorithm Theory - SWAT 2004
• THE EQUALITY PROBLEM FOR RATIONAL SERIES WITH MULTIPLICITIES IN THE TROPICAL SEMIRING IS UNDECIDABLE
• Reasoning about infinite computations
• Complexity of automaton identification from given data
• Parametric real-time reasoning
• Expressiveness and closure properties for quantitative languages
• Making Weighted Containment Feasible: A Heuristic Based on Simulation and Abstraction
• What’s Decidable about Weighted Automata?
• Quantitative Languages
• Computer Aided Verification
• Quantitative Languages Defined by Functional Automata
• Title not available (Why is that?)
• On Linear Characterizations of Combinatorial Optimization Problems

Cited In (2)

• Parameterized Weighted Containment
• Stochastization of Weighted Automata

This page was built for publication: Parameterized weighted containment

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2946752)