On Communicating Automata with Bounded Channels

Abstract. We review the characterization of communicating finite-state machines whose behaviors have universally or existentially bounded channels. These results rely on the theory of Mazurkiewicz traces. We investigate the question whether channel bound conditions are decidable for a given communicating finite-state machine.

• Type: Journal
• Year: 2007
• Where: FUIN
• Authors: Blaise Genest, Dietrich Kuske, Anca Muscholl
• Keywords: Channel Bound Conditions, Characterization, FUIN 2007, finite-state Machine