Algorithmic verification of linear temporal logic specifications

Yonit Kesten, Amir Pnueli, Li On Raviv

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

115 Scopus citations

Abstract

In this methodological paper we present a coherent framework for symbolic model checking verification of linear-time temporal logic (LTL) properties of reactive systems, taking full fairness into consideration. We use the computational model of a fair Kripke structure (FKS) which takes into account both justice (weak fairness) and compassion (strong fairness). The approach presented here reduces the model checking problem into the question of whether a given FKS is feasible (i.e. has at least one computation). The contribution of the paper is twofold: On the methodological level, it presents a direct self-contained exposition of full LTL symbolic model checking without resorting to reductions to either CTL or automata. On the technical level, it extends previous methods by dealing with compassion at the algorithmic level instead of adding it to the specification, and providing the first symbolic method for checking feasibility of FKS's (equivalently, symbolically checking for the emptiness of Streett automata). The presented algorithms can also be used (with minor modifications) for symbolic model-checking of CTL formulas over fair Kripke structures with compassion requirements.

Original languageEnglish
Title of host publicationAutomata, Languages and Programming - 25th International Colloquium, ICALP 1998, Proceedings
PublisherSpringer Verlag
Pages1-16
Number of pages16
ISBN (Print)3540647813, 9783540647812
DOIs
StatePublished - 1 Jan 1998
Event25th International Colloquium on Automata, Languages and Programming, ICALP 1998 - Aalborg, Denmark
Duration: 13 Jul 199817 Jul 1998

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume1443 LNCS
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Conference

Conference25th International Colloquium on Automata, Languages and Programming, ICALP 1998
Country/TerritoryDenmark
CityAalborg
Period13/07/9817/07/98

ASJC Scopus subject areas

  • Theoretical Computer Science
  • General Computer Science

Fingerprint

Dive into the research topics of 'Algorithmic verification of linear temporal logic specifications'. Together they form a unique fingerprint.

Cite this