Partial Model Checking and Partial Model Synthesis in LTL Using a Tableau-Based Approach

Serenella Cerrito (1) , Valentin Goranko (2, 3) , Sophie Paillocher (1)

1 IBISC - Informatique, BioInformatique, Systèmes Complexes
2 Stockholm University
3 WITS - University of the Witwatersrand [Johannesburg]

In the process of designing a computer system S and checking whether an abstract model M of S verifies a given specification property η, one might have only a partial knowledge of the model, either because M has not yet been completely defined (constructed) by the designer, or because it is not completely observable by the verifier. This leads to new verification problems, subsuming satisfiability and model checking as special cases. We state and discuss these problems in the case of LTL specifications, and develop a uniform tableau-based approach for their solutions.

Keywords: Linear temporal logic LTL; partial model checking; partial model synthesis; partial transition systems; tableaux

Domains: Computation and Language [cs.CL]; Logic in Computer Science [cs.LO]

Serenella Cerrito, Valentin Goranko, Sophie Paillocher. Partial Model Checking and Partial Model Synthesis in LTL Using a Tableau-Based Approach. 8th International Conference on Formal Structures for Computation and Deduction (FSCD 2023), Jul 2023, Rome, Italy. ⟨10.4230/LIPIcs.FSCD.2023.23⟩. ⟨hal-04180680⟩