415 search results - page 45 / 83 » Regular Processes and Timed Automata |
105
click to vote
APSEC
2002
IEEE
15 years 7 months ago
2002
IEEE
Many methods for XML processing have been proposed in the last few years. One popular approach is to process XML documents by using existing programming languages. Another popular...
110
click to vote
PODS
2007
ACM
16 years 2 months ago
2007
ACM
The pebble tree automaton and the pebble tree transducer are enhanced by additionally allowing an unbounded number of `invisible' pebbles (as opposed to the usual `visible�...
113
click to vote
STRINGOLOGY
2008
15 years 3 months ago
2008
The class of finite Sturmian words consists of words having particularly simple compressed representation, which is a generalization of the Fibonacci recurrence for Fibonacci word...
116
click to vote
ENTCS
2002
15 years 1 months ago
2002
We report on the automatic verification of timed probabilistic properties of the IEEE 1394 root contention protocol combining two existing tools: the real-time modelchecker Kronos...
127
click to vote
WEA
2010
Springer
15 years 7 months ago
2010
Springer
Server based route planning in road networks is now powerful enough to find quickest paths in a matter of milliseconds, even if detailed information on time-dependent travel times...