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 "bisimulations and logical characterizations on continuous time markov decision processes"):
  Abstract: In this paper we study strong and weak bisimulation equivalences for continuous-time Markov decision processes (CTMDPs) and the logical characterizations of these relations with respect to the continuous-time stochastic logic (CSL). For strong bisimulation, it is well known that it is strictly finer than CSL equivalence. In this paper we propose strong and weak bisimulations for CTMDPs and show that for a subclass of CTMDPs, strong and weak bisimulations are both sound and complete with respect to the equivalences induced by CSL and the sub-logic of CSL without next operator respectively. We then consider a standard extension of CSL, and show that it and its sub-logic without X can be fully characterized by strong and weak bisimulations respectively over arbitrary CTMDPs.

Includes members:
  Member "bisimulations meet pctl equivalences for probabilistic automata":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "probabilistic bisimulation naturally on distributions")
  Member "computing distances between probabilistic automata":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "quantitative aspects of programming languages and systems over the past 2 4 years and beyond")
  Member "efficient approximation of optimal control for markov games":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "finite optimal control for time bounded reachability in ctmdps and continuous time markov games")
  Member "finite optimal control for time bounded reachability in ctmdps and continuous time markov games":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "policy learning for time bounded reachability in continuous time markov decision processes via doubly stochastic gradient ascent")
  Member "flow faster efficient decision algorithms for probabilistic simulations":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "logical metric and algorithmic characterisations of probabilistic bisimulation")

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)