Synthesis from component libraries with costs

DOI10.1016/J.TCS.2017.11.001MaRDI QIDQ683714zbMATH OpenOpenAlexFDO

Authors Guy Avni, Orna Kupferman

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

component librariescost-sharing gameslattice automatasynthesis

Mathematics Subject Classification ID

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

Recommendations

• Synthesis from component libraries with costs
• Synthesis from Component Libraries
• Modular synthesis with open components
• Synthesis from recursive-components libraries
• The Complexity of Synthesis from Probabilistic Components

Cites work

• A class of games possessing pure-strategy Nash equilibria
• Algorithms for Omega-Regular Games with Imperfect Information
• Antichains and compositional algorithms for LTL synthesis
• Complete problems for deterministic polynomial time
• Composition for component-based modeling
• Congestion games with multisets of resources and applications in synthesis
• Formally reasoning about quality
• Handbook of weighted automata
• How bad is selfish routing?
• scientific article; zbMATH DE number 2080757 (Why is no real title available?)
• scientific article; zbMATH DE number 1500523 (Why is no real title available?)
• scientific article; zbMATH DE number 895368 (Why is no real title available?)
• Lattice Automata
• Minimizing deterministic lattice automata
• Model checking discounted temporal properties
• Model Checking Quantitative Linear Time Logic
• Network-formation games with regular objectives
• On the power of imperfect information
• Safraless Compositional Synthesis
• Synthesis from LTL specifications with mean-payoff objectives
• The complexity of propositional linear temporal logics
• The complexity of pure Nash equilibria
• THE EQUALITY PROBLEM FOR RATIONAL SERIES WITH MULTIPLICITIES IN THE TROPICAL SEMIRING IS UNDECIDABLE
• Tools and Algorithms for the Construction and Analysis of Systems
• Web services. Concepts, architectures and applications
• When does abstraction help?

Cited in

(3)

• Dynamic resource allocation games
• Synthesis from component libraries with costs
• Modular synthesis with open components

Describes a project that uses

Uses Software

• MONA

This page was built for publication: Synthesis from component libraries with costs

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