921 search results - page 78 / 185 » On Interleaving in Timed Automata |
124
click to vote
LATA
2010
Springer
16 years 3 months ago
2010
Springer
We study pregroup grammars with letter promotions p(m) q(n) . We show that the Letter Promotion Problem for pregroups is solvable in polynomial time, if the size of p(n)
143
click to vote
ACRI
2004
Springer
15 years 11 months ago
2004
Springer
The SLEUTH urban growth model [1] is a cellular automata model that has been widely applied throughout the geographic literature to examine the historic settlement patterns of citi...
172
click to vote
MEMOCODE
2003
IEEE
15 years 11 months ago
2003
IEEE
In this paper, we present a technique for determining tight bounds on the execution time of assembler programs. Thus, our method is independent of the design flow, but takes into...
249
click to vote
FASE
2004
Springer
15 years 10 months ago
2004
Springer
Real-Time Maude is a language and tool supporting the formal specification and analysis of real-time and hybrid systems. The specification formalism is based on rewriting logic, em...
172
click to vote
ACRI
2008
Springer
16 years 19 days ago
2008
Springer
This article studies the convergence properties of some 2D cellular automata, when a single cell is updated at random at each time step. We tackle this question for a particular s...