A characterization of definable communicating systems

MaRDI QIDQ2720916zbMATH OpenFDO

Authors I. Potapov

Publication date 2 July 2001

Published in Trudy Instituta Prikladnoĭ Matematiki i Mekhaniki (Search for Journal in Brave)

zbMATH Keywords

communicating automataFIFO channelprogressive communication

Mathematics Subject Classification ID

Network protocols (68M12) Distributed systems (68M14) Formal languages and automata (68Q45)

Review text

A network of finite automata communicating with each other over FIFO channels. The network is called a definable one if a natural number \(n\) exist such that every trajectory of transitions with length \(u\) defines its final state unambignouly. It is showed that a problem of definability is unsolvable.

Recommendations

• On communicating automata with bounded channels
• On the decidability of correctness problems for a communicating automata net
• Boundedness, empty channel detection, and synchronization for communicating finite automata
• Analysis of a class of communicating finite state machines
• scientific article; zbMATH DE number 3881887

Cited in

(2)

• On Generalized Communicating P Systems with One Symbol
• scientific article; zbMATH DE number 1543360 (Why is no real title available?)

This page was built for publication: A characterization of definable communicating systems

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2720916)