Undecidable problems in unreliable computations
نویسندگان
چکیده
منابع مشابه
Undecidable Problems in Unreliable Computations
Department of Computer Science, University of Edinburgh, JCMB, Edinburgh EH9 3JZ, UK. e-mail: [email protected] Abstract. Lossy counter machines are defined as Minsky n-counter machines where the values in the counters can spontaneously decrease at any time. While termination is decidable for lossy counter machines, structural termination (termination for every input) is undecidable. This und...
متن کاملHighly Undecidable Problems For Infinite Computations
We show that many classical decision problems about 1counter ω-languages, context free ω-languages, or infinitary rational relations, are Π12-complete, hence located at the second level of the analytical hierarchy, and “highly undecidable”. In particular, the universality problem, the inclusion problem, the equivalence problem, the determinizability problem, the complementability problem, and t...
متن کاملUndecidable Verification Problems for Programs with Unreliable Channels
We consider the veriication of a particular class of innnite-state systems, namely systems consisting of nite-state processes that communicate via unbounded lossy FIFO channels. This class is able to model e.g. link protocols such as the Alternating Bit Protocol and HDLC. In an earlier paper, we showed that several interesting veriication problems are decidable for this class of systems, namely...
متن کاملUndecidable Veriication Problems for Programs with Unreliable Channels
We consider the veriication of a particular class of innnite-state systems, namely systems consisting of nite-state processes that communicate via unbounded lossy FIFO channels. This class is able to model e.g. link protocols such as the Alternating Bit Protocol and HDLC. In an earlier paper, we showed that the problems of checking reachability, safety properties, and eventuality properties are...
متن کاملUnreliable Intrusion Detection in Distributed Computations
Distributed coordination is diicult, especially when the system may suuer intrusions that corrupt some component processes. In this paper we introduce the abstraction of a failure detector that a process can use to (imperfectly) detect the corruption (Byzantine failure) of another process. In general, our failure detectors can be unreliable, both by reporting a correct process to be faulty or b...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theoretical Computer Science
سال: 2003
ISSN: 0304-3975
DOI: 10.1016/s0304-3975(02)00646-1