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 ...

Abstract: In this presentation, we will discuss the relationship between the interpolation (logical) property and (algorithmic) decidability, the connection between interpolation and (algebraic) ...

This project presents machine-checked constructive proofs of soundness, completeness, decidability, and the small-model property for the logics K, K*, CTL, and PDL (with and without converse). For all ...