Soundness and Completeness of a Model-Checking Proof System for CTL
Logic in Computer Science
2023-09-12 v1
Abstract
We propose a local model-checking proof system for a fragment of CTL. The rules of the proof system are motivated by the well-known fixed-point characterisation of CTL based on unfolding of the temporal operators. To guarantee termination of proofs, we tag the sequents of our proof system with the set of states that have already been explored for the respective temporal formula. We define the semantics of tagged sequents, and then state and prove soundness and completeness of the proof system, as well as termination of proof search for finite-state models.
Cite
@article{arxiv.2309.05389,
title = {Soundness and Completeness of a Model-Checking Proof System for CTL},
author = {Georg Friedrich Schuppe and Dilian Gurov},
journal= {arXiv preprint arXiv:2309.05389},
year = {2023}
}
Comments
10 pages