human: Given a node-centered hypergraph: <hypergraph>, where nodes represent papers and hyperedges represent sets of papers co-cited by a source paper.

Details of the hypergraph:
Center node: "cost preserving bisimulations for probabilistic automata"
  Abstract: Probabilistic automata constitute a versatile and elegant model for#N#concurrent probabilistic systems. They are equipped with a compositional theory#N#supporting abstraction, enabled by weak probabilistic bisimulation serving as#N#the reference notion for summarising the effect of abstraction. This paper#N#considers probabilistic automata augmented with costs. It extends the notions#N#of weak transitions in probabilistic automata in such a way that the costs#N#incurred along a weak transition are captured. This gives rise to#N#cost-preserving and cost-bounding variations of weak probabilistic#N#bisimilarity, for which we establish compositionality properties with respect#N#to parallel composition. Furthermore, polynomial-time decision algorithms are#N#proposed, that can be effectively used to compute reward-bounding abstractions#N#of Markov decision processes in a compositional manner.

Connected through hyperedge HE-1 (induced by source paper "compositional reasoning for interval markov decision processes"):
  with members:
    - "probabilistic bisimulations for pctl model checking of interval mdps"

Question: Please tell me which class the center node 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.FL(Formal Languages and Automata Theory)