Sciweavers

3750 search results - page 387 / 750
» Timed Automata Patterns
Sort
View
FSTTCS
2008
Springer
15 years 5 months ago
Banach-Mazur Games on Graphs
We survey determinacy, definability, and complexity issues of Banach-Mazur games on finite and infinite graphs. Infinite games where two players take turns to move a token thro...
Erich Grädel
ASE
2005
137views more  ASE 2005»
15 years 4 months ago
Rewriting-Based Techniques for Runtime Verification
Techniques for efficiently evaluating future time Linear Temporal Logic (abbreviated LTL) formulae on finite execution traces are presented. While the standard models of LTL are i...
Grigore Rosu, Klaus Havelund
SIAMCOMP
2010
83views more  SIAMCOMP 2010»
15 years 2 months ago
Reaching and Distinguishing States of Distributed Systems
Some systems interact with their environment at physically distributed interfaces, called ports, and in testing such a system it is normal to place a tester at each port. Each test...
Robert M. Hierons
CVPR
1998
IEEE
16 years 6 months ago
Using Adaptive Tracking to Classify and Monitor Activities in a Site
We describe a vision system that monitors activity in a site over extended periods of time. The system uses a distributed set of sensors to cover the site, and an adaptive tracker...
W. Eric L. Grimson, Chris Stauffer, R. Romano, L. ...
ICDE
2006
IEEE
149views Database» more  ICDE 2006»
16 years 5 months ago
An Efficient XPath Query Processor for XML Streams
Streaming XPath evaluation algorithms must record a potentially exponential number of pattern matches when both predicates and descendant axes are present in queries, and the XML ...
Yi Chen, Susan B. Davidson, Yifeng Zheng