Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

15

FUIN
2007

favoriteEmaildiscussreport

91views more FUIN 2007»

On Communicating Automata with Bounded Channels

13 years 4 months ago

On Communicating Automata with Bounded Channels

Download www.labri.fr

Abstract. We review the characterization of communicating ﬁnite-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 ﬁnite-state machine.

Blaise Genest, Dietrich Kuske, Anca Muscholl

Real-time Traffic

Channel Bound Conditions | Characterization | FUIN 2007 | ﬁnite-state Machine |

claim paper

Related Content

» Optimal Lower Bounds on Regular Expression Size Using Communication Complexity

» Automata and Logics for Timed Message Sequence Charts

» Stochastic Channel Selection in Cognitive Radio Networks

» Stochastic Reasoning About ChannelBased Component Connectors

» Bisimulation and Other Undecidable Equivalences for Lossy Channel Systems

» Model Checking Lossy Channels Systems Is Probably Decidable

» Secure Communication over Parallel Relay Channel

» Multiparty Session Types Meet Communicating Automata

» Communication Topology Analysis for Concurrent Programs

Post Info
More Details (n/a)

Added	14 Dec 2010
Updated	14 Dec 2010
Type	Journal
Year	2007
Where	FUIN
Authors	Blaise Genest, Dietrich Kuske, Anca Muscholl

Comments (0)