---
res:
  bibo_abstract:
  - "Simulation is an attractive alternative for language inclusion for automata as
    it is an under-approximation of language inclusion, but usually has much lower
    complexity. For non-deterministic automata, while language inclusion is PSPACE-complete,
    simulation can be computed in polynomial time. Simulation has also been extended
    in two orthogonal directions, namely, (1) fair simulation, for simulation over
    specified set of infinite runs; and (2) quantitative simulation, for simulation
    between weighted automata. Again, while fair trace inclusion is PSPACE-complete,
    fair simulation can be computed in polynomial time. For weighted automata, the
    (quantitative) language inclusion problem is undecidable for mean-payoff automata
    and the decidability is open for discounted-sum automata, whereas the (quantitative)
    simulation reduce to mean-payoff games and discounted-sum games, which admit pseudo-polynomial
    time algorithms.\r\n\r\nIn this work, we study (quantitative) simulation for weighted
    automata with Büchi acceptance conditions, i.e., we generalize fair simulation
    from non-weighted automata to weighted automata. We show that imposing Büchi acceptance
    conditions on weighted automata changes many fundamental properties of the simulation
    games. For example, whereas for mean-payoff and discounted-sum games, the players
    do not need memory to play optimally; we show in contrast that for simulation
    games with Büchi acceptance conditions, (i) for mean-payoff objectives, optimal
    strategies for both players require infinite memory in general, and (ii) for discounted-sum
    objectives, optimal strategies need not exist for both players. While the simulation
    games with Büchi acceptance conditions are more complicated (e.g., due to infinite-memory
    requirements for mean-payoff objectives) as compared to their counterpart without
    Büchi acceptance conditions, we still present pseudo-polynomial time algorithms
    to solve simulation games with Büchi acceptance conditions for both weighted mean-payoff
    and weighted discounted-sum automata.@eng"
  bibo_authorlist:
  - foaf_Person:
      foaf_givenName: Krishnendu
      foaf_name: Chatterjee, Krishnendu
      foaf_surname: Chatterjee
      foaf_workInfoHomepage: http://www.librecat.org/personId=2E5DCA20-F248-11E8-B48F-1D18A9856A87
    orcid: 0000-0002-4561-241X
  - foaf_Person:
      foaf_givenName: Thomas A
      foaf_name: Henzinger, Thomas A
      foaf_surname: Henzinger
      foaf_workInfoHomepage: http://www.librecat.org/personId=40876CD8-F248-11E8-B48F-1D18A9856A87
    orcid: 0000−0002−2985−7724
  - foaf_Person:
      foaf_givenName: Jan
      foaf_name: Otop, Jan
      foaf_surname: Otop
      foaf_workInfoHomepage: http://www.librecat.org/personId=2FC5DA74-F248-11E8-B48F-1D18A9856A87
  - foaf_Person:
      foaf_givenName: Yaron
      foaf_name: Velner, Yaron
      foaf_surname: Velner
  bibo_doi: 10.15479/AT:IST-2014-315-v1-1
  dct_date: 2014^xs_gYear
  dct_isPartOf:
  - http://id.crossref.org/issn/2664-1690
  dct_language: eng
  dct_publisher: IST Austria@
  dct_title: Quantitative fair simulation games@
...