English (United Kingdom)

https://curated-unify.zendy.io/wp-json/zendy-region/v1/featured_content/oa?rat=en

https://curated-unify.zendy.io/wp-json/zendy-region/v1/highlighted_journal/

Global: Zendy Tools annual

Presents the keyphrase highlighting as premium feature

Keyphrase Highlighting

Presents the summarisation as premium feature

Summarisation

Insights

Presents the pdf analysis as premium feature

PDF Analysis

Presents the zaia usage as premium feature

ZAIA

Global: Zendy Tools monthly

Global: Zendy Plus monthly

Presents the access of premium content as premium feature

Premium Content

Global: Zendy Plus annual

Global: Zendy Free Plan

We propose a local model-checking proof system for a fragment of CTL. Therules of the proof system are motivated by the well-known fixed-pointcharacterisation of CTL based on unfolding of the temporal operators. Toguarantee termination of proofs, we tag the sequents of our proof system withthe set of states that have already been explored for the respective temporalformula. We define the semantics of tagged sequents, and then state and provesoundness and completeness of the proof system, as well as termination of proofsearch for finite-state models.

Soundness and Completeness of a Model-Checking Proof System for CTL