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 "what s decidable about parametric timed automata"):
  Abstract: Parametric timed automata (PTAs) are a powerful formalism to reason, simulate and formally verify critical real-time systems. After 25 years of research on PTAs, it is now well-understood that any non-trivial problem studied is undecidable for general PTAs. We provide here a survey of decision and computation problems for PTAs. On the one hand, bounding time, bounding the number of parameters or the domain of the parameters does not (in general) lead to any decidability. On the other hand, restricting the number of clocks, the use of clocks (compared or not with the parameters), and the use of parameters (e.g. used only as upper or lower bounds) leads to decidability of some problems. We also put emphasis on open problems. We also discuss formalisms close to parametric timed automata (such as parametric hybrid automata or parametric interrupt timed automata), and we study tools dedicated to PTAs and their extensions.

Includes members:
  Member "language preservation problems in parametric timed automata":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "consistency in parametric interval probabilistic timed automata")
  Member "polynomial interrupt timed automata":
    also connected through other hyperedges:
      (none)
  Member "language emptiness of continuous time parametric timed automata":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "consistency in parametric interval probabilistic timed automata")
  Member "interrupt timed automata with auxiliary clocks and parameters":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "parametric schedulability analysis of a launcher flight control system under reactivity constraints")
  Member "mtl model checking of one clock parametric timed automata is undecidable":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "parametric updates in parametric timed automata")
  Member "interrupt timed automata verification and expressiveness":
    also connected through other hyperedges:
      (none)
  Member "on the decidability and complexity of metric temporal logic over finite words":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "model checking the interval way")
  Member "real time model checking parameters everywhere":
    also connected through other hyperedges:
      (none)

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)