Reasoning with Temporal Logic on Truncated Paths Export

@incollection{citeulike:2122589, 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 = {Eisner, Cindy and Fisman, Dana and Havlicek, John and Lustig, Yoad and Mcisaac, Anthony and Van Campenhout, David}, citeulike-article-id = {2122589}, citeulike-linkout-0 = {http://www.springerlink.com/content/qb7881fh5xx4v056}, journal = {Computer Aided Verification}, keywords = {modal-logic, temporal-logic}, pages = {27--39}, posted-at = {2007-12-15 05:13:04}, priority = {2}, title = {Reasoning with Temporal Logic on Truncated Paths}, url = {http://www.springerlink.com/content/qb7881fh5xx4v056}, year = {2003} }

TY - CHAP ID - citeulike:2122589 L3 - citeulike-article-id:2122589 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. JF - Computer Aided Verification EP - 39 TI - Reasoning with Temporal Logic on Truncated Paths SP - 27 KW - modal-logic KW - temporal-logic AU - Eisner, Cindy AU - Fisman, Dana AU - Havlicek, John AU - Lustig, Yoad AU - Mcisaac, Anthony AU - Van Campenhout, David PY - 2003/// UR - http://www.springerlink.com/content/qb7881fh5xx4v056 ER -