@inproceedings{FismanTrack2, title={Track 2 : ( Logic , Semantics , Specification and Verification ) Title : Truncating Regular Expressions}, author={Dana Fisman} }

In previous work [6] we have shown that in order for temporal logic to be useful in incomplete verification methods such as simulation or bounded model checking, it is necessary to define semantics over truncated paths. A truncated path is a path which is finite, but not necessarily maximal. In this paper we examine the problem of expanding the previous work on LTL to a temporal logic augmented with regular expressions. Such extensions, adopted in emerging standards, are motivated by the desire… CONTINUE READING