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 "detecting unrealizability of distributed fault tolerant systems"):
  Abstract: Writing formal specifications for distributed systems is difficult. Even#N#simple consistency requirements often turn out to be unrealizable because of#N#the complicated information flow in the distributed system: not all information#N#is available in every component, and information transmitted from other#N#components may arrive with a delay or not at all, especially in the presence of#N#faults. The problem of checking the distributed realizability of a temporal#N#specification is, in general, undecidable. Semi-algorithms for synthesis, such#N#as bounded synthesis, are only useful in the positive case, where they#N#construct an implementation for a realizable specification, but not in the#N#negative case: if the specification is unrealizable, the search for the#N#implementation never terminates. In this paper, we introduce counterexamples to#N#distributed realizability and present a method for the detection of such#N#counterexamples for specifications given in linear-time temporal logic (LTL). A#N#counterexample consists of a set of paths, each representing a different#N#sequence of inputs from the environment, such that, no matter how the#N#components are implemented, the specification is violated on at least one of#N#these paths. We present a method for finding such counterexamples both for the#N#classic distributed realizability problem and for the fault-tolerant#N#realizability problem. Our method considers, incrementally, larger and larger#N#sets of paths until a counterexample is found. For safety specifications in#N#weakly ordered architectures we obtain a decision procedure, while#N#counterexamples for full LTL and arbitrary architectures may consist of#N#infinitely many paths. Experimental results, obtained with a QBF-based#N#prototype implementation, show that our method finds simple errors very#N#quickly, and even problems with high combinatorial complexity, like the#N#Byzantine Generals' Problem, are tractable.

Includes members:
  Member "environment assumptions for synthesis":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "the challenges in specifying and explaining synthesized implementations of reactive systems")
  Member "knowledge and common knowledge in a distributed environment":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "knowledge and simplicial complexes")

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)