Instruct: Identify the main and secondary category of Arxiv papers based on the titles and abstracts
Query: Concurrent bisimulation algorithm   The coarsest bisimulation-finding problem plays an important role in the
formal analysis of concurrent systems. For example, solving this problem allows
the behavior of different processes to be compared or specifications to be
verified. Hence, in this paper an efficient concurrent bisimulation algorithm
is presented. It is based on the sequential Paige and Tarjan algorithm and the
concept of the state signatures. The original solution follows Hopcroft's
principle "process the smaller half". The presented algorithm uses its
generalized version "process all but the largest one" better suited for
concurrent and parallel applications. The running time achieved is comparable
with the best known sequential and concurrent solutions. At the end of the
work, the results of tests carried out are presented. The question of the lower
bound for the running time of the optimal algorithm is also discussed.

8
The categories of this paper are: hep-ex
3
The categories of this paper are: physics
2
The categories of this paper are: math
5
The categories of this paper are: gr-qc
11
The categories of this paper are: hep-lat
31
The categories of this paper are: ao-sci
37
The categories of this paper are: supr-con
17
The categories of this paper are: q-fin
34
The categories of this paper are: chem-ph
23
The categories of this paper are: solv-int
4
The categories of this paper are: cond-mat
33
The categories of this paper are: plasm-ph
19
The categories of this paper are: eess
32
The categories of this paper are: atom-ph
25
The categories of this paper are: patt-sol
12
The categories of this paper are: nucl-th