---
res:
  bibo_abstract:
  - "We automatically compute a new class of environment assumptions in two-player
    turn-based finite graph games which characterize an “adequate cooperation” needed
    from the environment to allow the system player to win. Given an ω-regular winning
    condition Φ for the system player, we compute an ω-regular assumption Ψ for the
    environment player, such that (i) every environment strategy compliant with Ψ
    allows the system to fulfill Φ (sufficiency), (ii) Ψ\r\n can be fulfilled by the
    environment for every strategy of the system (implementability), and (iii) Ψ does
    not prevent any cooperative strategy choice (permissiveness).\r\nFor parity games,
    which are canonical representations of ω-regular games, we present a polynomial-time
    algorithm for the symbolic computation of adequately permissive assumptions and
    show that our algorithm runs faster and produces better assumptions than existing
    approaches—both theoretically and empirically. To the best of our knowledge, for
    ω\r\n-regular games, we provide the first algorithm to compute sufficient and
    implementable environment assumptions that are also permissive.@eng"
  bibo_authorlist:
  - foaf_Person:
      foaf_givenName: Ashwani
      foaf_name: Anand, Ashwani
      foaf_surname: Anand
  - foaf_Person:
      foaf_givenName: Kaushik
      foaf_name: Mallik, Kaushik
      foaf_surname: Mallik
      foaf_workInfoHomepage: http://www.librecat.org/personId=0834ff3c-6d72-11ec-94e0-b5b0a4fb8598
    orcid: 0000-0001-9864-7475
  - foaf_Person:
      foaf_givenName: Satya Prakash
      foaf_name: Nayak, Satya Prakash
      foaf_surname: Nayak
  - foaf_Person:
      foaf_givenName: Anne Kathrin
      foaf_name: Schmuck, Anne Kathrin
      foaf_surname: Schmuck
  bibo_doi: 10.1007/978-3-031-30820-8_15
  bibo_volume: 13994
  dct_date: 2023^xs_gYear
  dct_identifier:
  - UT:001288698100015
  dct_isPartOf:
  - http://id.crossref.org/issn/0302-9743
  - http://id.crossref.org/issn/1611-3349
  - http://id.crossref.org/issn/9783031308192
  dct_language: eng
  dct_publisher: Springer Nature@
  dct_title: Computing adequately permissive assumptions for synthesis@
...