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 "fast algorithms for handling diagonal constraints in timed automata"):
  Abstract: A popular method for solving reachability in timed automata proceeds by enumerating reachable sets of valuations represented as zones. A naive enumeration of zones does not terminate. Various termination mechanisms have been studied over the years. Coming up with efficient termination mechanisms has been remarkably more challenging when the automaton has diagonal constraints in guards. #R##N#In this paper, we propose a new termination mechanism for timed automata with diagonal constraints based on a new simulation relation between zones. Experiments with an implementation of this simulation show significant gains over existing methods.

Includes members:
  Member "reachability in timed automata with diagonal constraints":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "revisiting timed logics with automata modalities")
  Member "revisiting timed logics with automata modalities":
    also connected through other hyperedges:
      (none)
  Member "symbolic optimal reachability in weighted timed automata":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "better abstractions for timed automata")
  Member "better abstractions for timed automata":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "automated synthesis of local time requirement for service composition")
  Member "improving search order for reachability testing in timed automata":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "abstraction refinement algorithms for timed automata")
  Member "lazy abstractions for timed automata":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "abstraction refinement algorithms for timed automata")

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.FL(Formal Languages and Automata Theory)