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 "verifying asynchronous interactions via communicating session automata"):
  Abstract: The relationship between communicating automata and session types is the cornerstone of many diverse theories and tools, including type checking, code generation, and runtime verification. A serious limitation of session types is that, while endpoint programs interact asynchronously, the underlying property which guarantees safety of session types is too synchronous: it requires a one-to-one synchronisation between send and receive actions. This paper proposes a sound procedure to verify properties of communicating session automata (CSA), i.e., communicating automata that correspond to multiparty session types. We introduce a new asynchronous compatibility property for CSA, called k-multiparty compatibility (k-MC), which is a strict superset of the synchronous multiparty compatibility proposed in the literature. It is decomposed into two bounded properties: (i) a condition called k-safety which guarantees that, within the bound, all sent messages can be received and each automaton can make a move; and (ii) a condition called k-exhaustivity which guarantees that all k-reachable send actions can be fired within the bound. We show that k-exhaustive systems soundly and completely characterise systems where each automaton behaves uniformly for any bound greater or equal to k. We show that checking k-MC is PSPACE-complete, but can be done efficiently over large systems by using partial order reduction techniques. We demonstrate that several examples from the literature are k-MC, but not synchronous compatible.

Includes members:
  Member "on the completeness of verifying message passing programs under bounded asynchrony":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "on the k synchronizability of systems")
  Member "synchronizability of communicating finite state machines is not decidable":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "verification of flat fifo systems")
  Member "multiparty compatibility for concurrent objects":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "liveness for verification")
  Member "timed runtime monitoring for multiparty conversations":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "an operational guide to monitorability")
  Member "multiparty session actors":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "gradual session types")
  Member "multiparty compatibility in communicating automata characterisation and synthesis of global session types":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "service equivalence via multiparty session type isomorphisms")
  Member "propositional dynamic logic for message passing systems":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "non sequential theory of distributed systems")

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.PL(Programming Languages)