Instruct: Identify the main and secondary category of Arxiv papers based on the titles and abstracts
Query: LTL to Deterministic Emerson-Lei Automata   We introduce a new translation from linear temporal logic (LTL) to
deterministic Emerson-Lei automata, which are omega-automata with a Muller
acceptance condition symbolically expressed as a Boolean formula. The richer
acceptance condition structure allows the shift of complexity from the state
space to the acceptance condition. Conceptually the construction is an enhanced
product construction that exploits knowledge of its components to reduce the
number of states. We identify two fragments of LTL, for which one can easily
construct deterministic automata and show how knowledge of these components can
reduce the number of states. We extend this idea to a general LTL framework,
where we can use arbitrary LTL to deterministic automata translators for parts
of formulas outside the mentioned fragments. Further, we show succinctness of
the translation compared to existing construction. The construction is
implemented in the tool Delag, which we evaluate on several benchmarks of LTL
formulas and probabilistic model checking case studies.

15
The categories of this paper are: nucl-ex
31
The categories of this paper are: ao-sci
34
The categories of this paper are: chem-ph
36
The categories of this paper are: cmp-lg
22
The categories of this paper are: chao-dyn
8
The categories of this paper are: hep-ex
24
The categories of this paper are: dg-ga
25
The categories of this paper are: patt-sol
29
The categories of this paper are: funct-an
14
The categories of this paper are: math-ph
28
The categories of this paper are: alg-geom
17
The categories of this paper are: q-fin
2
The categories of this paper are: math
7
The categories of this paper are: hep-th
5
The categories of this paper are: gr-qc
4
The categories of this paper are: cond-mat