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: "supervisory control of fuzzy discrete event systems a formal approach"
  Abstract: Fuzzy discrete event systems (DESs) were proposed recently by Lin and Ying, which may better cope with the real-world problems of fuzziness, impreciseness, and subjectivity such as those in biomedicine. As a continuation of, in this paper, we further develop fuzzy DESs by dealing with supervisory control of fuzzy DESs. More specifically: 1) we reformulate the parallel composition of crisp DESs, and then define the parallel composition of fuzzy DESs that is equivalent to that in . Max-product and max-min automata for modeling fuzzy DESs are considered, 2) we deal with a number of fundamental problems regarding supervisory control of fuzzy DESs, particularly demonstrate controllability theorem and nonblocking controllability theorem of fuzzy DESs, and thus, present the conditions for the existence of supervisors in fuzzy DESs; 3) we analyze the complexity for presenting a uniform criterion to test the fuzzy controllability condition of fuzzy DESs modeled by max-product automata; in particular, we present in detail a general computing method for checking whether or not the fuzzy controllability condition holds, if max-min automata are used to model fuzzy DESs, and by means of this method we can search for all possible fuzzy states reachable from initial fuzzy state in max-min automata. Also, we introduce the fuzzy n-controllability condition for some practical problems, and 4) a number of examples serving to illustrate the applications of the derived results and methods are described; some basic properties related to supervisory control of fuzzy DESs are investigated. To conclude, some related issues are raised for further consideration.

Connected through hyperedge HE-1 (induced by source paper "supervisory control of fuzzy discrete event systems for simulation equivalence"):
  with members:
    - "computation of the greatest simulations and bisimulations between fuzzy automata"
    - "model checking of linear time properties based on possibility measure"
    - "bisimulations for fuzzy transition systems"
    - "state based control of fuzzy discrete event systems"
    - "fuzzy discrete event systems under fuzzy observability and a test algorithm"
    - "supervisory control of fuzzy discrete event systems"
    - "observability and decentralized control of fuzzy discrete event systems"

Connected through hyperedge HE-2 (induced by source paper "bifuzzy discrete event systems and their supervisory control theory"):
  with members:
    - "fuzzy discrete event systems under fuzzy observability and a test algorithm"
    - "supervisory control of fuzzy discrete event systems"
    - "observability and decentralized control of fuzzy discrete event systems"

Connected through hyperedge HE-3 (induced by source paper "computation of the greatest simulations and bisimulations between fuzzy automata"):
  with members:
    - "construction of fuzzy automata from fuzzy regular expressions"
    - "bisimulations for fuzzy transition systems"
    - "bisimulations for fuzzy automata"
    - "reduction of fuzzy automata by means of fuzzy quasi orders"
    - "simulation vs equivalence"
    - "state based control of fuzzy discrete event systems"
    - "generalizing the paige tarjan algorithm by abstract interpretation"
    - "fuzzy discrete event systems under fuzzy observability and a test algorithm"

Connected through hyperedge HE-4 (induced by source paper "reduction of fuzzy automata by means of fuzzy quasi orders"):
  with members:
    - "state based control of fuzzy discrete event systems"
    - "generalizing the paige tarjan algorithm by abstract interpretation"
    - "fuzzy discrete event systems under fuzzy observability and a test algorithm"
    - "supervisory control of fuzzy discrete event systems"
    - "observability and decentralized control of fuzzy discrete event systems"

Connected through hyperedge HE-5 (induced by source paper "bisimulations for fuzzy automata"):
  with members:
    - "reduction of fuzzy automata by means of fuzzy quasi orders"
    - "simulation vs equivalence"
    - "generalizing the paige tarjan algorithm by abstract interpretation"
    - "fuzzy discrete event systems under fuzzy observability and a test algorithm"

Connected through hyperedge HE-6 (induced by source paper "bisimulations for fuzzy transition systems"):
  with members:
    - "a fuzzy petri nets model for computing with words"
    - "supervisory control of fuzzy discrete event systems"

Connected through hyperedge HE-7 (induced by source paper "nondeterministic fuzzy automata"):
  with members:
    - "bisimulations for fuzzy transition systems"
    - "supervisory control of fuzzy discrete event systems"

Connected through hyperedge HE-8 (induced by source paper "a fuzzy petri nets model for computing with words"):
  with members:
    - "probabilistic automata for computing with words"
    - "supervisory control of fuzzy discrete event systems"
    - "observability and decentralized control of fuzzy discrete event systems"

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)