]> 2026-09-14T17:41:40+00:00 Symbolic construction of GR(1) contracts for systems with full information 0 en This work proposes a symbolic algorithm for the construction of assume-guarantee specifications that allow multiple agents to coop- erate. Each agent is assigned goals expressed in a fragment of linear temporal logic known as gener- alized Streett with one pair, GR(1). These goals may be unrealizable, unless each agent makes additional assumptions, about the behavior of other agents. The algorithm constructs a con- tract among the agents, in that only the infinite behavior of the given goals is constrained, known as liveness, not the finite one, known as safety. This defers synthesis to a later stage of refinement, modularizing the design process. We prove that there exist GR(1) games that do not admit any GR(1) contract. For this reason, we formulate contracts with nested GR(1) properties and auxiliary communication variables, and prove that they always exist. The algorithmâs fixpoint structure is similar to GR(1) synthesis, enjoying time complexity polynomial in the number of states, and linear in number of recurrence goals. Ioannis Filippidis and Richard M. Murray NCS 2015h 2016 American Control Conference (ACC) fm16-acc Conference Paper 2016-06-10T06:06:52Z 2457549.7547685 Symbolic construction of GR(1) contracts for systems with full information Title 102 en Title