Instruct: Identify the main and secondary category of Arxiv papers based on the titles and abstracts
Query: Synchronizability of Communicating Finite State Machines is not
  Decidable   A system of communicating finite state machines is synchronizable if its send
trace semantics, i.e.the set of sequences of sendings it can perform, is the
same when its communications are FIFO asynchronous and when they are just
rendez-vous synchronizations. This property was claimed to be decidable in
several conference and journal papers for either mailboxes or peer-to-peer
communications, thanks to a form of small model property. In this paper, we
show that this small model property does not hold neither for mailbox
communications, nor for peer-to-peer communications, therefore the decidability
of synchronizability becomes an open question. We close this question for
peer-to-peer communications, and we show that synchronizability is actually
undecidable. We show that synchronizability is decidable if the topology of
communications is an oriented ring. We also show that, in this case,
synchronizability implies the absence of unspecified receptions and orphan
messages, and the channel-recognizability of the reachability set.

4
The categories of this paper are: cond-mat
34
The categories of this paper are: chem-ph
5
The categories of this paper are: gr-qc
23
The categories of this paper are: solv-int
37
The categories of this paper are: supr-con
3
The categories of this paper are: physics
25
The categories of this paper are: patt-sol
14
The categories of this paper are: math-ph
6
The categories of this paper are: astro-ph
36
The categories of this paper are: cmp-lg
9
The categories of this paper are: nlin
31
The categories of this paper are: ao-sci
24
The categories of this paper are: dg-ga
8
The categories of this paper are: hep-ex
28
The categories of this paper are: alg-geom
15
The categories of this paper are: nucl-ex