Instruct: Identify the main and secondary category of Arxiv papers based on the titles and abstracts
Query: BigCarl: Mining frequent subnets from a single large Petri net   While there have been lots of work studying frequent subgraph mining, very
rare publications have discussed frequent subnet mining from more complicated
data structures such as Petri nets. This paper studies frequent subnets mining
from a single large Petri net. We follow the idea of transforming a Petri net
in net graph form and to mine frequent sub-net graphs to avoid high complexity.
Technically, we take a minimal traversal approach to produce a canonical label
of the big net graph. We adapted the maximal independent embedding set approach
to the net graph representation and proposed an incremental pattern growth
(independent embedding set reduction) way for discovering frequent sub-net
graphs from the single large net graph, which are finally transformed back to
frequent subnets. Extensive performance studies made on a single large Petri
net, which contains 10K events, 40K conditions and 30 K arcs, showed that our
approach is correct and the complexity is reasonable.

35
The categories of this paper are: mtrl-th
8
The categories of this paper are: hep-ex
15
The categories of this paper are: nucl-ex
21
The categories of this paper are: adap-org
7
The categories of this paper are: hep-th
20
The categories of this paper are: acc-phys
18
The categories of this paper are: econ
14
The categories of this paper are: math-ph
16
The categories of this paper are: stat
31
The categories of this paper are: ao-sci
25
The categories of this paper are: patt-sol
3
The categories of this paper are: physics
5
The categories of this paper are: gr-qc
19
The categories of this paper are: eess
10
The categories of this paper are: q-bio
17
The categories of this paper are: q-fin