Channel system (computer science)

In computer science, a channel system is a finite-state machine similar to communicating finite-state machine in which there is a single system communicating with itself instead of many systems communicating with each other.

Uses your system voice; voice and rate in settings.

Snapshot

≈ 2 min read

Names in other languages

No names in other languages are held for this entry yet.

Article bodies are English and are not machine-translated. A name in another language is not a translation of the article.

In computer science, a channel system is a finite-state machine similar to communicating finite-state machine in which there is a single system communicating with itself instead of many systems communicating with each other. A channel system is similar to a pushdown automaton where a queue is used instead of a stack. Those queues are called channels.

Intuitively, each channel represents a sequence a message to be sent, and to be read in the order in which they are sent. Q=\{q_1,\dots,q_m\} a finite set of control states, q_0\in Q an initial state, A a finite alphabet (for the sake of notation simplicity, let \epsilon \in A ), C=\{c_1,\dots,c_n\} a finite set of channels, \Sigma=\{a_1,\dots,a_p\} a finite alphabet of messages, \Delta\subseteq Q\times C\times\{?,!\}\times\Sigma^*\times A \times Q a finite set of transition rules with \Sigma^* being the set of finite (potentially empty) words over the alphabet \Sigma .

Depending on the author, a channel system may have no initial state and may have an empty alphabet. A configuration or global state of the channel system is a n+1 tuple belonging to Q\times\prod_{i=1}^n(\Sigma^*) .

Intuitively, a configuration \gamma=(q,w_1,\dots,w_m) represents that a run is in state q and that its i -th channel contains the word w_i . The initial configuration is (q_0,\epsilon,\dots,\epsilon) , with \epsilon the empty word.

Communicating Hierarchical State Machine

Hierarchical state machines are finite-state machines whose states themselves can be other machines. Since a communicating finite-state machine is characterized by concurrency, the most notable trait in a communicating hierarchical state machine is the coexistence of hierarchy and concurrency.

This had been considered highly suitable as it signifies stronger interaction inside the machine. However, it was proved that the coexistence of hierarchy and concurrency intrinsically costs language inclusion, language equivalence, and all of universality.

Text derived from https://en.wikipedia.org/w/index.php?oldid=1314739051 under CC BY-SA 4.0; modifications have been made.

Provenance

snapshot enwiki-001314739051 · captured 2025-10-02 · not yet sealed in the ledger · verify the chain · version history

Cite this page as: encyclopegia.org, “Channel system (computer science)”, snapshot enwiki-001314739051. https://encyclopegia.org/a/channel-system-computer-science

Sources cited in this revision

No external citation was extracted for this revision. That is a statement about the source, not a claim that none exists.