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 "coarse abstractions make zeno behaviours difficult to detect"):
  Abstract: An infinite run of a timed automaton is Zeno if it spans only a finite amount#N#of time. Such runs are considered unfeasible and hence it is important to#N#detect them, or dually, find runs that are non-Zeno. Over the years important#N#improvements have been obtained in checking reachability properties for timed#N#automata. We show that some of these very efficient optimizations make testing#N#for Zeno runs costly. In particular we show NP-completeness for the#N#LU-extrapolation of Behrmann et al. We analyze the source of this complexity in#N#detail and give general conditions on extrapolation operators that guarantee a#N#(low) polynomial complexity of Zenoness checking. We propose a slight weakening#N#of the LU-extrapolation that satisfies these conditions.

Includes members:
  Member "better abstractions for timed automata":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "automated synthesis of local time requirement for service composition")
  Member "using non convex approximations for efficient analysis of timed automata":
    also connected through other hyperedges:
      - Hyperedge HE-2 (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.LO(Logic in Computer Science)