Instruct: Identify the main and secondary category of Arxiv papers based on the titles and abstracts
Query: Generating and Solving Symbolic Parity Games   We present a new tool for verification of modal mu-calculus formulae for
process specifications, based on symbolic parity games. It enhances an existing
method, that first encodes the problem to a Parameterised Boolean Equation
System (PBES) and then instantiates the PBES to a parity game. We improved the
translation from specification to PBES to preserve the structure of the
specification in the PBES, we extended LTSmin to instantiate PBESs to symbolic
parity games, and implemented the recursive parity game solving algorithm by
Zielonka for symbolic parity games. We use Multi-valued Decision Diagrams
(MDDs) to represent sets and relations, thus enabling the tools to deal with
very large systems. The transition relation is partitioned based on the
structure of the specification, which allows for efficient manipulation of the
MDDs. We performed two case studies on modular specifications, that demonstrate
that the new method has better time and memory performance than existing PBES
based tools and can be faster (but slightly less memory efficient) than the
symbolic model checker NuSMV.

9
The categories of this paper are: nlin
37
The categories of this paper are: supr-con
2
The categories of this paper are: math
17
The categories of this paper are: q-fin
15
The categories of this paper are: nucl-ex
3
The categories of this paper are: physics
30
The categories of this paper are: q-alg
28
The categories of this paper are: alg-geom
26
The categories of this paper are: bayes-an
29
The categories of this paper are: funct-an
11
The categories of this paper are: hep-lat
36
The categories of this paper are: cmp-lg
4
The categories of this paper are: cond-mat
21
The categories of this paper are: adap-org
34
The categories of this paper are: chem-ph
23
The categories of this paper are: solv-int