Instruct: Identify the main and secondary category of Arxiv papers based on the titles and abstracts
Query: On the Expressive Power of the Normal Form for Branching-Time Temporal
  Logics   With the emerging applications that involve complex distributed systems
branching-time specifications are specifically important as they reflect
dynamic and non-deterministic nature of such applications. We describe the
expressive power of a simple yet powerful branching-time specification
framework -- branching-time normal form (BNF), which has been developed as part
of clausal resolution for branching-time temporal logics. We show the encoding
of Buchi Tree Automata in the language of the normal form, thus representing,
syntactically, tree automata in a high-level way. Thus we can treat BNF as a
normal form for the latter. These results enable us (1) to translate given
problem specifications into the normal form and apply as a verification method
a deductive reasoning technique -- the clausal temporal resolution; (2) to
apply one of the core components of the resolution method -- the loop searching
to extract, syntactically, hidden invariants in a wide range of complex
temporal specifications.

19
The categories of this paper are: eess
36
The categories of this paper are: cmp-lg
22
The categories of this paper are: chao-dyn
23
The categories of this paper are: solv-int
37
The categories of this paper are: supr-con
29
The categories of this paper are: funct-an
6
The categories of this paper are: astro-ph
2
The categories of this paper are: math
8
The categories of this paper are: hep-ex
3
The categories of this paper are: physics
14
The categories of this paper are: math-ph
25
The categories of this paper are: patt-sol
13
The categories of this paper are: quant-ph
12
The categories of this paper are: nucl-th
4
The categories of this paper are: cond-mat
17
The categories of this paper are: q-fin