1650 search results - page 7 / 330 » The HOM problem is decidable |
STACS
2009
Springer
14 years 2 months ago
2009
Springer
Abstract. This paper solves the unambiguity and the sequentiality problem for polynomially ambiguous min-plus automata. This result is proved through a decidable algebraic characte...
FSTTCS
2006
Springer
13 years 11 months ago
2006
Springer
We establish a decidability boundary of the model checking problem for infinite-state systems defined by Process Rewrite Systems (PRS) or weakly extended Process Rewrite Systems (w...
ICALP
2005
Springer
14 years 1 months ago
2005
Springer
Abstract. This paper is concerned with the language inclusion problem for timed automata: given timed automata A and B, is every word accepted by B also accepted by A? Alur and Dil...
ICRA
2007
IEEE
14 years 1 months ago
2007
IEEE
— Classical path planning does not address many of the challenges of robotic systems subject to differential constraints. While there have been many recent efforts to develop mot...
PRDC
2007
IEEE
14 years 1 months ago
2007
IEEE
We propose a comprehensive solution to handle memory-overflow problems in multitasking embedded systems thereby improving their reliability and availability. In particular, we pro...