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 "cegar for qualitative analysis of probabilistic systems"):
  Abstract: We consider Markov decision processes (MDPs) which are a standard model for probabilistic systems. We focus on qualitative properties for MDPs that can express that desired behaviors of the system arise almost-surely (with probability 1) or with positive probability. We introduce a new simulation relation to capture the refinement relation of MDPs with respect to qualitative properties, and present discrete graph theoretic algorithms with quadratic complexity to compute the simulation relation. We present an automated technique for assume-guarantee style reasoning for compositional analysis of MDPs with qualitative properties by giving a counter-example guided abstraction-refinement approach to compute our new simulation relation. We have implemented our algorithms and show that the compositional analysis leads to significant improvements.

Includes members:
  Member "the complexity of partial observation stochastic parity games with finite memory strategies":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "secure control under partial observability with temporal logic constraints")
  Member "what is decidable about partially observable markov decision processes with omega regular objectives":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "point based methods for model checking in partially observable markov decision processes")
  Member "interface simulation distances":
    also connected through other hyperedges:
      (none)
  Member "assume guarantee abstraction refinement for probabilistic systems":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "compositional verification for autonomous systems with deep learning components")
  Member "faster algorithms for alternating refinement relations":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "improved algorithms for one pair and k pair streett objectives")
  Member "decidable problems for probabilistic automata on infinite words":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "the complexity of pomdps with long run average objectives")
  Member "an o n 2 time algorithm for alternating b uchi games":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "verification of markov decision processes using learning algorithms")
  Member "partial observation stochastic games how to win when belief fails":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "alternating tree automata with qualitative semantics")

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)