Synthesis from Component Libraries with Costs

DOI10.1007/978-3-662-44584-6_12zbMath1417.68097OpenAlexW2222633210MaRDI QIDQ3190115

Guy Avni, Orna Kupferman

Publication date: 15 September 2014

Published in: CONCUR 2014 – Concurrency Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-662-44584-6_12

Mathematics Subject Classification ID

Applications of game theory (91A80) Specification and verification (program logics, model checking, etc.) (68Q60) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85) Resource and cost allocation (including fair division, apportionment, etc.) (91B32)

Related Items (6)

The Complexity of Synthesis from Probabilistic Components ⋮ Network-formation games with regular objectives ⋮ Synthesis of large dynamic concurrent programs from dynamic specifications ⋮ Hierarchical Network Formation Games ⋮ On High-Quality Synthesis ⋮ Dynamic Resource Allocation Games

This page was built for publication: Synthesis from Component Libraries with Costs