374 search results - page 1 / 75 » On Communicating Automata with Bounded Channels |
FUIN
2007
13 years 4 months ago
2007
Abstract. We review the characterization of communicating finite-state machines whose behaviors have universally or existentially bounded channels. These results rely on the theor...
FOSSACS
2008
Springer
13 years 6 months ago
2008
Springer
The problem of converting deterministic finite automata into (short) regular expressions is considered. It is known that the required expression size is 2(n) in the worst case for ...
FSTTCS
2007
Springer
13 years 10 months ago
2007
Springer
Abstract. We provide a framework for distributed systems that impose timing constraints on their executions. We propose a timed model of communicating finite-state machines, which...
GLOBECOM
2007
IEEE
13 years 11 months ago
2007
IEEE
— In this paper, we investigate the channel selection strategy for secondary users in cognitive radio networks. We claim that in order to avoid the costly channel switchings, a s...
COORDINATION
2006
Springer
13 years 8 months ago
2006
Springer
Abstract. Constraint automata have been used as an operational model for component connectors that coordinate the cooperation and communication of the components by means of a netw...