Parameterized Weighted Containment

DOI10.1145/2665076zbMath1354.68145OpenAlexW1966557697MaRDI QIDQ2946752

Orna Kupferman, Guy Avni

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

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)

Related Items (1)

Stochastization of Weighted Automata

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• The ellipsoid method and its consequences in combinatorial optimization
• Reasoning about infinite computations
• 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
• Complexity of automaton identification from given data
• THE EQUALITY PROBLEM FOR RATIONAL SERIES WITH MULTIPLICITIES IN THE TROPICAL SEMIRING IS UNDECIDABLE
• On Linear Characterizations of Combinatorial Optimization Problems
• Parametric real-time reasoning
• Algorithm Theory - SWAT 2004
• Computer Aided Verification
• Quantitative Languages Defined by Functional Automata

This page was built for publication: Parameterized Weighted Containment