Download PDFOpen PDF in browserTableau-Like Automata-Based Axiomatization for Propositional Linear Temporal Logic2 pages•Published: March 24, 2013AbstractPropositional Linear Temporal Logic (PLTL) is a very popular formalism for specification and verification of computer programs and systems. This extended abstract sketches a tableau-like axiomatization for PLTL based on automata-theoretic decision procedure coupled with tableau for local model checking of the propositional μ-Calculus.Keyphrases: automata theoretic decision technique, model checking, mu calculus, propositional linear temporal logic In: Alex Simpson (editor). PSPL 2010. International Workshop on Proof Systems for Program Logics, vol 12, pages 23-24.
|