Reasoning with temporal logic on truncated paths

Cindy Eisner, Dana Fisman, John Havlicek, Yoad Lustig, Anthony McIsaac, David Van Campenhout

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

134 Scopus citations

Abstract

We consider the problem of reasoning with linear temporal logic on truncated paths. A truncated path is a path that is finite, but not necessarily maximal. Truncated paths arise naturally in several areas, among which are incomplete verification methods (such as simulation or bounded model checking) and hardware resets. We present a formalism for reasoning about truncated paths, and analyze its characteristics.

Original languageEnglish
Title of host publicationLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
EditorsWarren A. Hunt, Fabio Somenzi
PublisherSpringer Verlag
Pages27-39
Number of pages13
Volume275
ISBN (Print)3540405240, 9783540405245
DOIs
StatePublished - 1 Jan 2003
Externally publishedYes

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Computer Science (all)

Fingerprint

Dive into the research topics of 'Reasoning with temporal logic on truncated paths'. Together they form a unique fingerprint.

Cite this