1147 search results - page 19 / 230 » Termination in language-based systems |
ENTCS
2008
13 years 7 months ago
2008
We describe a method for proving the termination of graph transformation systems. The method is based on the fact that infinite reductions must include infinite `creation chains&#...
RTA
2007
Springer
14 years 1 months ago
2007
Springer
The use of automata techniques to prove the termination of string rewrite systems and left-linear term rewrite systems is advocated by Geser et al. in a recent sequence of papers. ...
CORR
2010
Springer
13 years 6 months ago
2010
Springer
The safety of infinite state systems can be checked by a backward reachability procedure. For certain classes of systems, it is possible to prove the termination of the procedure ...
IROS
2007
IEEE
14 years 1 months ago
2007
IEEE
— For the design of an automated transportation system in an actual seaport container terminal, it is necessary to take into consideration the maintenance of operating robots (AG...
TON
2010
13 years 2 months ago
2010
In this paper we study several ways in which mobile terminals can backoff on their uplink transmit power in order to extend battery lifetimes. This is particularly effective when a...