Instruct: Identify the main and secondary category of Arxiv papers based on the titles and abstracts
Query: Decomposition of transition systems into sets of synchronizing state
  machines   Transition systems (TS) and Petri nets (PN) are important models of
computation ubiquitous in formal methods for modeling systems. An important
problem is how to extract from a given TS a PN whose reachability graph is
equivalent (with a suitable notion of equivalence) to the original TS.
  This paper addresses the decomposition of transition systems into
synchronizing state machines (SMs), which are a class of Petri nets where each
transition has one incoming and one outgoing arc and all markings have exactly
one token. This is an important case of the general problem of extracting a PN
from a TS. The decomposition is based on the theory of regions, and it is shown
that a property of regions called excitation-closure is a sufficient condition
to guarantee the equivalence between the original TS and a decomposition into
SMs.
  An efficient algorithm is provided which solves the problem by reducing its
critical steps to the maximal independent set problem (to compute a minimal set
of irredundant SMs) or to satisfiability (to merge the SMs). We report
experimental results that show a good trade-off between quality of results vs.
computation time.

23
The categories of this paper are: solv-int
26
The categories of this paper are: bayes-an
35
The categories of this paper are: mtrl-th
28
The categories of this paper are: alg-geom
24
The categories of this paper are: dg-ga
25
The categories of this paper are: patt-sol
7
The categories of this paper are: hep-th
6
The categories of this paper are: astro-ph
31
The categories of this paper are: ao-sci
5
The categories of this paper are: gr-qc
3
The categories of this paper are: physics
22
The categories of this paper are: chao-dyn
21
The categories of this paper are: adap-org
16
The categories of this paper are: stat
30
The categories of this paper are: q-alg
9
The categories of this paper are: nlin