Show simple item record

dc.contributor.authorDrusinsky, Doron
dc.date.accessioned2014-03-25T16:32:34Z
dc.date.available2014-03-25T16:32:34Z
dc.date.issued2006
dc.identifier.citationJournal of Universal Computer Science, vol. 12, no. 5 (2006), 482-498
dc.identifier.urihttp://hdl.handle.net/10945/39579
dc.description.abstractIn this paper we describe a technique for monitoring and checking temporal logic assertions augmented with real-time and time-series constraints, or Metric Temporal Logic Series (MTLS). The method is based on Remote Execution and Monitoring (REM) of temporal logic assertions. We describe the syntax and semantics of MTLS and a monitoring technique based on alternating finite automata that is efficient for a large set of frequently used formulae and is also an on-line technique. We investigate the run-time data-structure size for several interesting assertions taken from the Kansas State specification patterns.en_US
dc.rightsThis publication is a work of the U.S. Government as defined in Title 17, United States Code, Section 101. As such, it is in the public domain, and under the provisions of Title 17, United States Code, Section 105, may not be copyrighted.en_US
dc.titleOn-line Monitoring of Metric Temporal Logic with Time- Series Constraints Using Alternating Finite Automataen_US
dc.typeArticleen_US
dc.contributor.departmentComputer Science (CS)
dc.subject.authorformal specificationen_US
dc.subject.authortemporal logicen_US
dc.subject.authorrun-time monitoringen_US
dc.subject.authorrun-time verificationen_US
dc.subject.authoralternating automataen_US
dc.subject.authortime seriesen_US
dc.subject.authorassertionsen_US
dc.subject.authorreactive systemsen_US


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record