Title
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.
Year
Venue
Keywords
2007
Fundam. Inform.
existentially bounded channel,mazurkiewicz trace,bounded channels,finite-state machine,mazurkiewicz traces.,communicating automata
Field
DocType
Volume
Discrete mathematics,Communication channel,Decidability,Communicating automata,Mathematics,Bounded function
Journal
80
Issue
ISSN
Citations 
1-3
0169-2968
9
PageRank 
References 
Authors
0.56
27
3
Name
Order
Citations
PageRank
Blaise Genest130425.09
Dietrich Kuske248547.93
Anca Muscholl3117974.92