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: "checking deadlock freedom of parametric component based systems"
  Abstract: We propose an automated method for computing inductive invariants applied to check deadlock-freedom for parametric component-based systems. The method generalizes the approach for computing structural trap invariants from bounded to parametric systems with general architectures. It symbolically extracts trap invariants from a monadic interaction formula characterizing the system architecture. The paper presents the theoretical foundations of the method including new results for the first order monadic logic and proves its soundness. It also provides preliminary illustrations on examples.

Connected through hyperedge HE-1 (induced by source paper "architecture modelling of parametric component based systems"):
  with members:
    - "on weighted configuration logics"

Connected through hyperedge HE-2 (induced by source paper "weighted parametric systems modelling and architecture"):
  with members:
    - "structural invariants for parametric verification of systems with almost linear architectures"
    - "interaction semantics and its implications for an interaction oriented architecture of iot type applications"
    - "on weighted configuration logics"
    - "weighted linear dynamic logic"

Connected through hyperedge HE-3 (induced by source paper "weighted parametric systems modelling and architecture specification"):
  with members:
    - "structural invariants for parametric verification of systems with almost linear architectures"
    - "interaction semantics and its implications for an interaction oriented architecture of iot type applications"
    - "weighted linear dynamic logic"

Connected through hyperedge HE-4 (induced by source paper "structural invariants for the verification of systems with parameterized architectures"):
  with members:
    - "analyzing guarded protocols better cutoffs more systems more expressivity"
    - "approaching the coverability problem continuously"
    - "tight cutoffs for guarded protocols with fairness"

Connected through hyperedge HE-5 (induced by source paper "architecture specification of parametric component based systems"):
  with members:
    - "structural invariants for parametric verification of systems with almost linear architectures"

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.LO(Logic in Computer Science)