Instruct: Identify the main and secondary category of Arxiv papers based on the titles and abstracts
Query: Bounded Model Checking of an MITL Fragment for Timed Automata   Timed automata (TAs) are a common formalism for modeling timed systems.
Bounded model checking (BMC) is a verification method that searches for runs
violating a property using a SAT or SMT solver. MITL is a real-time extension
of the linear time logic LTL. Originally, MITL was defined for traces of
non-overlapping time intervals rather than the "super-dense" time traces
allowing for intervals overlapping in single points that are employed by the
nowadays common semantics of timed automata. In this paper we extend the
semantics of a fragment of MITL to super-dense time traces and devise a bounded
model checking encoding for the fragment. We prove correctness and completeness
in the sense that using a sufficiently large bound a counter-example to any
given non-holding property can be found. We have implemented the proposed
bounded model checking approach and experimentally studied the efficiency and
scalability of the implementation.

22
The categories of this paper are: chao-dyn
34
The categories of this paper are: chem-ph
21
The categories of this paper are: adap-org
23
The categories of this paper are: solv-int
10
The categories of this paper are: q-bio
37
The categories of this paper are: supr-con
28
The categories of this paper are: alg-geom
7
The categories of this paper are: hep-th
30
The categories of this paper are: q-alg
18
The categories of this paper are: econ
0
The categories of this paper are: hep-ph
2
The categories of this paper are: math
16
The categories of this paper are: stat
26
The categories of this paper are: bayes-an
15
The categories of this paper are: nucl-ex
9
The categories of this paper are: nlin