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 meet pctl equivalences for probabilistic automata"):
  Abstract: Probabilistic automata (PAs) have been successfully applied in formal#N#verification of concurrent and stochastic systems. Efficient model checking#N#algorithms have been studied, where the most often used logics for expressing#N#properties are based on probabilistic computation tree logic (PCTL) and its#N#extension PCTL^*. Various behavioral equivalences are proposed, as a powerful#N#tool for abstraction and compositional minimization for PAs. Unfortunately, the#N#equivalences are well-known to be sound, but not complete with respect to the#N#logical equivalences induced by PCTL or PCTL*. The desire of a both sound and#N#complete behavioral equivalence has been pointed out by Segala in 1995, but#N#remains open throughout the years. In this paper we introduce novel notions of#N#strong bisimulation relations, which characterize PCTL and PCTL* exactly. We#N#extend weak bisimulations that characterize PCTL and PCTL* without next#N#operator, respectively. Further, we also extend the framework to simulation#N#preorders. Thus, our paper bridges the gap between logical and behavioral#N#equivalences and preorders in this setting.

Includes members:
  Member "computing distances between probabilistic automata":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "quantitative aspects of programming languages and systems over the past 2 4 years and beyond")
  Member "characterising probabilistic processes logically":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "logical characterization of bisimulation metrics")

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)