Abstract: In this paper, we investigate the decidability and complexity of the fault diagnosis problem in unbounded labeled Petri nets. First, we show that checking diagnosability for unbounded Petri ...

Decidability marks the boundary between algorithmic problems that can always be solved and those that cannot. Turing machines are powerful enough to express ordinary computation, but that power makes ...

Abstract: The satisfiability and algorithmic decidability problems are discussed for message passing models of distributed programs represented as processes communicating through buffers. The ...

Turing Machine Variants and Decidable Problems The basic Turing machine model is deliberately minimal, so it is natural to ask whether more convenient versions compute more languages. Multitape ...