Instruct: Identify the main and secondary category of Arxiv papers based on the titles and abstracts
Query: Improving BDD Based Symbolic Model Checking with Isomorphism Exploiting
  Transition Relations   Symbolic model checking by using BDDs has greatly improved the applicability
of model checking. Nevertheless, BDD based symbolic model checking can still be
very memory and time consuming. One main reason is the complex transition
relation of systems. Sometimes, it is even not possible to generate the
transition relation, due to its exhaustive memory requirements. To diminish
this problem, the use of partitioned transition relations has been proposed.
However, there are still systems which can not be verified at all. Furthermore,
if the granularity of the partitions is too fine, the time required for
verification may increase. In this paper we target the symbolic verification of
asynchronous concurrent systems. For such systems we present an approach which
uses similarities in the transition relation to get further memory reductions
and runtime improvements. By applying our approach, even the verification of
systems with an previously intractable transition relation becomes feasible.

9
The categories of this paper are: nlin
10
The categories of this paper are: q-bio
36
The categories of this paper are: cmp-lg
16
The categories of this paper are: stat
31
The categories of this paper are: ao-sci
37
The categories of this paper are: supr-con
2
The categories of this paper are: math
5
The categories of this paper are: gr-qc
22
The categories of this paper are: chao-dyn
26
The categories of this paper are: bayes-an
3
The categories of this paper are: physics
20
The categories of this paper are: acc-phys
24
The categories of this paper are: dg-ga
13
The categories of this paper are: quant-ph
6
The categories of this paper are: astro-ph
19
The categories of this paper are: eess