On the decidability of correctness problems for a communicating automata net (Q2735908)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 1641410
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | On the decidability of correctness problems for a communicating automata net |
scientific article; zbMATH DE number 1641410 |
Statements
23 September 2001
0 references
communicating finite state machines
0 references
decidability
0 references
boundedness
0 references
deadlocks
0 references
unspecified receptions
0 references
0.9038036
0 references
0 references
0.87161523
0 references
0.87160534
0 references
0.87007093
0 references
0.87007093
0 references
0.8700075
0 references
0.8682822
0 references
On the decidability of correctness problems for a communicating automata net (English)
0 references
It is considered the well known problem concerning a finite set of finite state machines that exchange messages via one-directional channel: ``Is these a positive integer \(k\) such that the communication between the machines over \(k\)-capacity channels is guaranteed to progress infinitely i.e. free from deadlocks and unspecified receptions?'' The problem is known to be undecidable in general. Restriction on the power of the messages are received for which the problem is decidable.
0 references
