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: "off line test selection with test purposes for non deterministic timed automata"
  Abstract: This article proposes novel off-line test generation techniques from#N#non-deterministic timed automata with inputs and outputs (TAIOs) in the formal#N#framework of the tioco conformance theory. In this context, a fi?rst problem is#N#the determinization of TAIOs, which is necessary to foresee next enabled#N#actions after an observable trace, but is in general impossible because not all#N#timed automata are determinizable. This problem is solved thanks to an#N#approximate determinization using a game approach. The algorithm performs an#N#io-abstraction which preserves the tioco conformance relation and thus#N#guarantees the soundness of generated test cases. A second problem is the#N#selection of test cases from a TAIO speci?fication. The selection here relies#N#on a precise description of timed behaviors to be tested which is carried out#N#by expressive test purposes modeled by a generalization of TAIOs. Finally, an#N#algorithm is described which generates test cases in the form of TAIOs equipped#N#with verdicts, using a symbolic co-reachability analysis guided by the test#N#purpose. Properties of test cases are then analyzed with respect to the#N#precision of the approximate determinization: when determinization is exact,#N#which is the case on known determinizable classes, in addition to soundness,#N#properties characterizing the adequacy of test cases verdicts are also#N#guaranteed.

Connected through hyperedge HE-1 (induced by source paper "control strategies for off line testing of timed systems"):
  with members:
    - "undecidable problems about timed automata"

Connected through hyperedge HE-2 (induced by source paper "bounded determinization of timed automata with silent transitions"):
  with members:
    - "undecidable problems about timed automata"

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)