Making Weighted Containment Feasible: A Heuristic Based on Simulation and Abstraction

DOI10.1007/978-3-642-32940-1_8zbMath1364.68242OpenAlexW1901242960MaRDI QIDQ2914365

Guy Avni, Orna Kupferman

Publication date: 25 September 2012

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-32940-1_8

Mathematics Subject Classification ID

Applications of game theory (91A80) Formal languages and automata (68Q45)

Related Items (4)

An abstraction-refinement methodology for reasoning about network games ⋮ Rigorous approximated determinization of weighted automata ⋮ Parameterized Weighted Containment ⋮ Computing branching distances with quantitative games

This page was built for publication: Making Weighted Containment Feasible: A Heuristic Based on Simulation and Abstraction