scientific article; zbMATH DE number 1927551

zbMATH Open1012.68119MaRDI QIDQ4484475FDOQ4484475

Authors: Amir Pnueli, Yonit Kesten 

Publication date: 12 June 2003

Full work available at URL: http://link.springer.de/link/service/series/0558/bibs/2421/24210024.htm

Title of this publication is not available (Why is that?)

Recommendations

• A Sound and Complete Deductive System for CTL* Verification
• A compositional approach to CTL\(^*\) verification
• Probabilistic \(\mathrm{CTL}^*\): the deductive way
• On automation of \(\mathsf{CTL}^*\) verification for infinite-state systems
• Deductive verification of alternating systems

Mathematics Subject Classification ID

Specification and verification (program logics, model checking, etc.) (68Q60) Temporal logic (03B44) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Cited In (16)

• A complete proof system for propositional projection temporal logic
• Branching-time logic \(\mathsf{ECTL}^{\#}\) and its tree-style one-pass tableau: extending fairness expressibility of \(\mathsf{ECTL}^+\)
• All-path reachability logic
• On automation of \(\mathsf{CTL}^*\) verification for infinite-state systems
• Title not available (Why is that?)
• A tableau-based decision procedure for CTL\(^*\)
• Probabilistic \(\mathrm{CTL}^*\): the deductive way
• CTL model checking in deduction modulo
• A compositional approach to CTL\(^*\) verification
• Proof-based verification approaches for dynamic properties: application to the information system domain
• A proof system for unified temporal logic
• A Sound and Complete Deductive System for CTL* Verification
• An axiomatization of PCTL*
• A decision procedure and complete axiomatization for projection temporal logic
• Completeness and Decidability Results for CTL in Coq
• Deductive verification of alternating systems

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4484475)