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: "permissive controller synthesis for probabilistic systems"
  Abstract: We propose novel controller synthesis techniques for probabilistic systems  modelled using stochastic two-player games: one player acts as a controller, the second  represents its environment, and probability is used to capture uncertainty arising due to,  for example, unreliable sensors or faulty system components. Our aim is to generate robust  controllers that are resilient to unexpected system changes at runtime, and flexible enough  to be adapted if additional constraints need to be imposed. We develop a permissive controller  synthesis framework, which generates multi-strategies for the controller, offering a  choice of control actions to take at each time step. We formalise the notion of permissivity  using penalties, which are incurred each time a possible control action is disallowed by  a multi-strategy. Permissive controller synthesis aims to generate a multi-strategy that  minimises these penalties, whilst guaranteeing the satisfaction of a specified system property.  We establish several key results about the optimality of multi-strategies and the  complexity of synthesising them. Then, we develop methods to perform permissive controller  synthesis using mixed integer linear programming and illustrate their effectiveness  on a selection of case studies.

Connected through hyperedge HE-1 (induced by source paper "the probabilistic model checker storm"):
  with members:
    - "counterexample driven synthesis for probabilistic program sketches"
    - "safety analysis for vehicle guidance systems with dynamic fault trees"
    - "parameter synthesis for markov models"
    - "value iteration for long run average reward in markov decision processes"
    - "markov automata with multiple objectives"
    - "maximizing the conditional expected reward for reaching the goal"
    - "a storm is coming a modern probabilistic model checker"
    - "parameter synthesis for markov models faster than ever"

Connected through hyperedge HE-2 (induced by source paper "spectra a specification language for reactive systems"):
  with members:
    - "performance heuristics for gr 1 synthesis and related algorithms"
    - "synthesizing a lego forklift controller in gr 1 a case study"
    - "better quality in synthesis through quantitative objectives"

Connected through hyperedge HE-3 (induced by source paper "permissive finite state controllers of pomdps using parameter synthesis"):
  with members:
    - "parametric markov chains pctl complexity and fraction free gaussian elimination"
    - "sequential convex programming for the efficient verification of parametric mdps"
    - "a storm is coming a modern probabilistic model checker"
    - "parameter synthesis for markov models faster than ever"
    - "safety constrained reinforcement learning for mdps"
    - "a symbolic sat based algorithm for almost sure reachability with small strategies in pomdps"
    - "optimal cost almost sure reachability in pomdps"
    - "solving pomdps by searching the space of finite policies"

Connected through hyperedge HE-4 (induced by source paper "a storm is coming a modern probabilistic model checker"):
  with members:
    - "parameter synthesis for markov models faster than ever"
    - "extracting verified decision procedures dpll and resolution"
    - "high level counterexamples for probabilistic automata"
    - "safety constrained reinforcement learning for mdps"
    - "analysis of timed and long run objectives for markov automata"
    - "verification of markov decision processes using learning algorithms"
    - "a robust class of data languages and an application to learning"

Connected through hyperedge HE-5 (induced by source paper "supervisor synthesis of pomdp based on automata learning"):
  with members:
    - "counterexample guided abstraction refinement for pomdps"
    - "a storm is coming a modern probabilistic model checker"
    - "a symbolic sat based algorithm for almost sure reachability with small strategies in pomdps"
    - "replanning in domains with partial information and sensing actions"
    - "randomness for free"
    - "speeding up the convergence of value iteration in partially observable markov decision processes"

Connected through hyperedge HE-6 (induced by source paper "permissive supervisor synthesis for markov decision processes through learning"):
  with members:
    - "transfer entropy in mdps with temporal logic specifications"
    - "a learning based optimal human robot collaboration with linear temporal logic constraints"
    - "assume guarantee abstraction refinement for probabilistic systems"
    - "optimal and approximate q value functions for decentralized pomdps"

Connected through hyperedge HE-7 (induced by source paper "the probabilistic model checker storm extended abstract"):
  with members:
    - "parameter synthesis for markov models faster than ever"
    - "bounded model checking for probabilistic programs"
    - "safety constrained reinforcement learning for mdps"
    - "uppaal smc statistical model checking for priced timed automata"

Connected through hyperedge HE-8 (induced by source paper "counterexample explanation by learning small strategies in markov decision processes"):
  with members:
    - "high level counterexamples for probabilistic automata"
    - "verification of markov decision processes using learning algorithms"
    - "cegar for qualitative analysis of probabilistic systems"
    - "spudd stochastic planning using decision diagrams"
    - "assume guarantee abstraction refinement for probabilistic systems"
    - "measuring permissiveness in parity games mean payoff parity games revisited"
    - "significant diagnostic counterexamples in probabilistic model checking"
    - "decision theoretic planning structural assumptions and computational leverage"

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)