human: Given a hyperedge-centered hypergraph: <hypergraph>, where the center hyperedge is induced by one source paper and its member nodes are the cited papers.

Details of the hypergraph:
Center hyperedge (induced by source paper "translating asynchronous games for distributed synthesis full version"):
  Abstract: In distributed synthesis, we generate a set of process implementations that, together, accomplish an objective against all possible behaviors of the environment. A lot of recent work has focussed on systems with causal memory, i.e., sets of asynchronous processes that exchange their causal histories upon synchronization. Decidability results for this problem have been stated either in terms of control games, which extend Zielonka's asynchronous automata by partitioning the actions into controllable and uncontrollable, or in terms of Petri games, which extend Petri nets by partitioning the tokens into system and environment players. The precise connection between these two models was so far, however, an open question. In this paper, we provide the first formal connection between control games and Petri games. We establish the equivalence of the two game models based on weak bisimulations between their strategies. For both directions, we show that a game of one type can be translated into an equivalent game of the other type. We provide exponential upper and lower bounds for the translations. Our translations make it possible to transfer and combine decidability results between the two types of games. Exemplarily, we translate decidability in acyclic communication architectures, originally obtained for control games, to Petri games, and decidability in single-process systems, originally obtained for Petri games, to control games.

Includes members:
  Member "high level representation of benchmark families for petri games":
    also connected through other hyperedges:
      (none)
  Member "symbolic vs bounded synthesis for petri games":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "high level representation of benchmark families for petri games")
  Member "synthesis in distributed environments":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "high level representation of benchmark families for petri games")
  Member "on the control of asynchronous automata":
    also connected through other hyperedges:
      (none)
  Member "automated synthesis of distributed controllers":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "parameterized synthesis for fragments of first order logic over data words")
  Member "distributed synthesis for acyclic architectures":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "decidable synthesis of programs with uninterpreted functions")
  Member "petri games synthesis of distributed systems with causal memory":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "parameterized synthesis for fragments of first order logic over data words")
  Member "asynchronous games over tree architectures":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "high level representation of benchmark families for petri games")

Question: Please tell me which class the source paper belongs to. The 40 classes are: cs.NA(Numerical Analysis), cs.MM(Multimedia), cs.LO(Logic in Computer Science), cs.CY(Computers and Society), cs.CR(Cryptography and Security), cs.DC(Distributed, Parallel, and Cluster Computing), cs.HC(Human-Computer Interaction), cs.CE(Computational Engineering, Finance, and Science), cs.NI(Networking and Internet Architecture), cs.CC(Computational Complexity), cs.AI(Artificial Intelligence), cs.MA(Multiagent Systems), cs.GL(General Literature), cs.NE(Neural and Evolutionary Computing), cs.SC(Symbolic Computation), cs.AR(Hardware Architecture), cs.CV(Computer Vision and Pattern Recognition), cs.GR(Graphics), cs.ET(Emerging Technologies), cs.SY(Systems and Control), cs.CG(Computational Geometry), cs.OH(Other Computer Science), cs.PL(Programming Languages), cs.SE(Software Engineering), cs.LG(Machine Learning), cs.SD(Sound), cs.SI(Social and Information Networks), cs.RO(Robotics), cs.IT(Information Theory), cs.PF(Performance), cs.CL(Computation and Language), cs.IR(Information Retrieval), cs.MS(Mathematical Software), cs.FL(Formal Languages and Automata Theory), cs.DS(Data Structures and Algorithms), cs.OS(Operating Systems), cs.GT(Computer Science and Game Theory), cs.DB(Databases), cs.DL(Digital Libraries), cs.DM(Discrete Mathematics). Directly output the class name.

gpt: cs.LO(Logic in Computer Science)