Reasoning with temporal logic on truncated paths

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

doi:10.1007/978-3-540-45069-6_3

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 proceeding › Conference contribution › peer-review

152 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 language	English
Title of host publication	Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Editors	Warren A. Hunt, Fabio Somenzi
Publisher	Springer Verlag
Pages	27-39
Number of pages	13
Volume	275
ISBN (Print)	3540405240, 9783540405245
DOIs	https://doi.org/10.1007/978-3-540-45069-6_3
State	Published - 1 Jan 2003
Externally published	Yes

ASJC Scopus subject areas

Theoretical Computer Science
General Computer Science

Access to Document

10.1007/978-3-540-45069-6_3

Cite this

Eisner, C., Fisman, D., Havlicek, J., Lustig, Y., McIsaac, A., & Van Campenhout, D. (2003). Reasoning with temporal logic on truncated paths. In W. A. Hunt, & F. Somenzi (Eds.), Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 275, pp. 27-39). Springer Verlag. https://doi.org/10.1007/978-3-540-45069-6_3

@inproceedings{c72b6a97936a4b929c6d07d783ef6cbf,

title = "Reasoning with temporal logic on truncated paths",

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.",

author = "Cindy Eisner and Dana Fisman and John Havlicek and Yoad Lustig and Anthony McIsaac and {Van Campenhout}, David",

year = "2003",

month = jan,

day = "1",

doi = "10.1007/978-3-540-45069-6_3",

language = "English",

isbn = "3540405240",

volume = "275",

pages = "27--39",

editor = "Hunt, {Warren A.} and Fabio Somenzi",

booktitle = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",

publisher = "Springer Verlag",

address = "Germany",

}

Eisner, C, Fisman, D, Havlicek, J, Lustig, Y, McIsaac, A & Van Campenhout, D 2003, Reasoning with temporal logic on truncated paths. in WA Hunt & F Somenzi (eds), Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). vol. 275, Springer Verlag, pp. 27-39. https://doi.org/10.1007/978-3-540-45069-6_3

Reasoning with temporal logic on truncated paths. / Eisner, Cindy; Fisman, Dana; Havlicek, John et al.
Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). ed. / Warren A. Hunt; Fabio Somenzi. Vol. 275 Springer Verlag, 2003. p. 27-39.

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

TY - GEN

T1 - Reasoning with temporal logic on truncated paths

AU - Eisner, Cindy

AU - Fisman, Dana

AU - Havlicek, John

AU - Lustig, Yoad

AU - McIsaac, Anthony

AU - Van Campenhout, David

PY - 2003/1/1

Y1 - 2003/1/1

N2 - 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.

AB - 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.

UR - http://www.scopus.com/inward/record.url?scp=35248878834&partnerID=8YFLogxK

U2 - 10.1007/978-3-540-45069-6_3

DO - 10.1007/978-3-540-45069-6_3

M3 - Conference contribution

AN - SCOPUS:35248878834

SN - 3540405240

SN - 9783540405245

VL - 275

SP - 27

EP - 39

BT - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

A2 - Hunt, Warren A.

A2 - Somenzi, Fabio

PB - Springer Verlag

ER -

Reasoning with temporal logic on truncated paths

Abstract

ASJC Scopus subject areas

Access to Document

Other files and links

Fingerprint

Cite this