Sciweavers

921 search results - page 180 / 185
» On Interleaving in Timed Automata
Sort
View
SOCO
2010
Springer
13 years 5 months ago
Automatic detection of trends in time-stamped sequences: an evolutionary approach
This paper presents an evolutionary algorithm for modeling the arrival dates in time-stamped data sequences such as newscasts, e-mails, IRC conversations, scientific journal artic...
Lourdes Araujo, Juan Julián Merelo Guerv&oa...
FSTTCS
2008
Springer
13 years 8 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»
13 years 7 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
CORR
2004
Springer
137views Education» more  CORR 2004»
13 years 7 months ago
Implementation of Logical Functions in the Game of Life
: The Game of Life cellular automaton is a classical example of a massively parallel collision-based computing device. The automaton exhibits mobile patterns, gliders, and generato...
Jean-Philippe Rennard
SIAMCOMP
2010
83views more  SIAMCOMP 2010»
13 years 5 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