Synthesis from component libraries with costs

DOI10.1016/j.tcs.2017.11.001zbMath1386.68099OpenAlexW2767430445MaRDI QIDQ683714

Orna Kupferman, Guy Avni

Publication date: 9 February 2018

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2017.11.001

zbMATH Keywords

synthesiscost-sharing gamescomponent librarieslattice automata

Mathematics Subject Classification ID

Applications of game theory (91A80) Formal languages and automata (68Q45) Specification and verification (program logics, model checking, etc.) (68Q60) Temporal logic (03B44)

Related Items

Dynamic resource allocation games

Uses Software

• MONA

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Antichains and compositional algorithms for LTL synthesis
• Handbook of weighted automata
• Complete problems for deterministic polynomial time
• Composition for component-based modeling
• Web services. Concepts, architectures and applications
• When does abstraction help?
• A class of games possessing pure-strategy Nash equilibria
• Model checking discounted temporal properties
• Formally Reasoning About Quality
• How bad is selfish routing?
• The complexity of pure Nash equilibria
• The complexity of propositional linear temporal logics
• THE EQUALITY PROBLEM FOR RATIONAL SERIES WITH MULTIPLICITIES IN THE TROPICAL SEMIRING IS UNDECIDABLE
• Tools and Algorithms for the Construction and Analysis of Systems
• Synthesis from LTL Specifications with Mean-Payoff Objectives
• Network-Formation Games with Regular Objectives
• Model Checking Quantitative Linear Time Logic
• Algorithms for Omega-Regular Games with Imperfect Information
• Lattice Automata
• Safraless Compositional Synthesis
• Minimizing Deterministic Lattice Automata