| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 6875942 | Theoretical Computer Science | 2016 | 21 Pages |
Abstract
In spite of these attractive features, many important theoretical problems about SRV are still open. In this paper, we address complexity, expressiveness, succinctness, and closure issues for the subclass of Boolean SRV (BSRV) specifications. Additionally, we show that for this subclass, offline monitoring can be performed with only two passes (one forward and one backward) over the input trace in spite of the alternation of past and future references in the BSRV specification.
Keywords
Related Topics
Physical Sciences and Engineering
Computer Science
Computational Theory and Mathematics
Authors
Laura Bozzelli, César Sánchez,