Download PDFOpen PDF in browser

Tableau-Like Automata-Based Axiomatization for Propositional Linear Temporal Logic

2 pagesPublished: March 24, 2013

Abstract

Propositional 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

Links:
BibTeX entry
@inproceedings{PSPL2010:Tableau_Like_Automata_Based_Axiomatization_for,
  author    = {Nikolay V. Shilov},
  title     = {Tableau-Like Automata-Based Axiomatization for Propositional Linear Temporal Logic},
  booktitle = {PSPL 2010. International Workshop on Proof Systems for Program Logics},
  editor    = {Alex Simpson},
  series    = {EPiC Series in Computing},
  volume    = {12},
  pages     = {23--24},
  year      = {2013},
  publisher = {EasyChair},
  bibsource = {EasyChair, https://easychair.org},
  issn      = {2398-7340},
  url       = {https://easychair.org/publications/paper/lGW},
  doi       = {10.29007/df56}}
Download PDFOpen PDF in browser