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. © Springer-Verlag Berlin Heidelberg 2003.
Cite
CITATION STYLE
Eisner, C., Fisman, D., Havlicek, J., Lustig, Y., McIsaac, A., & Van Campenhout, D. (2003). Reasoning with temporal logic on truncated paths. Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 2725, 27–39. https://doi.org/10.1007/978-3-540-45069-6_3
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
