On Termination for Faulty Channel Machines

Details On Termination for Faulty Channel Machines On Termination for Faulty Channel Machines

2008-02-20

arxiv.org/abs/0802.2839v1

Dans Proceedings of the 25th Annual Symposium on the Theoretical Aspects of Computer Science - STACS 2008, Bordeaux : France (

Computer Science

Information Theory

Scientific paper

A channel machine consists of a finite controller together with several fifo channels; the controller can read messages from the head of a channel and write messages to the tail of a channel. In this paper, we focus on channel machines with insertion errors, i.e., machines in whose channels messages can spontaneously appear. Such devices have been previously introduced in the study of Metric Temporal Logic. We consider the termination problem: are all the computations of a given insertion channel machine finite? We show that this problem has non-elementary, yet primitive recursive complexity.

Affiliated with

Also associated with

No associations

Rating

On Termination for Faulty Channel Machines does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with On Termination for Faulty Channel Machines, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and On Termination for Faulty Channel Machines will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-647799