human: Given a hyperedge-centered hypergraph: <hypergraph>, where the center hyperedge groups authors who co-authored the same paper.

Details of the hypergraph:
Center hyperedge (induced by source paper "Online minimization of transition systems (extended abstract)"):
  Abstract: We are given a transition system implicitly through a compact representation and wish to perform simultaneously reachability analysis and minimization without constructing first the whole system graph. We present an algorithm for this problem that applies to general systems, provided we have appropriate primitive operations for manipulating blocks of states and we can determine termination; the number of operations needed to construct the minimal reachable graph is quadratic in the size of this graph. We specialize the method to obtain efficient algorithms for extended finite state machines that apply separable affine transformations on the variables.

Includes members:
  Member "An implementation of three algorithms for timing verification based on automata emptiness":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "Extending Promela and Spin for Real Time")
  Member "Formal methods for protocol testing: a detailed study":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "Test development for communication protocols: towards automation")

Question: Please tell me which research area the co-authored paper (i.e., the source paper of the center hyperedge) belongs to. The 4 classes are: Computer science, Mathematics, Engineering, Economics, Psychology, Business. Directly output the class name.

gpt: Mathematics