REVIEW 1 cited by
Assume-Admissible Synthesis
Not yet reviewed by Pith; the record is open.
This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.
SPECIMEN: schema-true, not a live event
T0 review · schema-true
One-sentence machine reading of the paper's core claim.
pith:XXXXXXXX · record.json · timestamp
Signed reviews
read the original abstract
In this paper, we introduce a novel rule for synthesis of reactive systems, applicable to systems made of n components which have each their own objectives. It is based on the notion of admissible strategies. We compare our novel rule with previous rules defined in the literature, and we show that contrary to the previous proposals, our rule defines sets of solutions which are rectangular. This property leads to solutions which are robust and resilient. We provide algorithms with optimal complexity and also an abstraction framework.
Forward citations
Cited by 1 Pith paper
-
Dynamic Coalitions in Games on Graphs with Preferences over Temporal Goals
A polynomial-time algorithm synthesizes admissible strategies for a leader who dynamically forms coalitions with at most one partner in deterministic multiplayer games with temporal preferences.
Discussion (0). Continue with ORCID to comment.