1650 search results - page 100 / 330 » The HOM problem is decidable |
ICCNMC
2005
Springer
14 years 3 months ago
2005
Springer
Transcoding proxy caching is an important technology for improving the services over Internet, especially in the environment of mobile computing systems. In this paper, we address ...
FORMATS
2004
Springer
14 years 3 months ago
2004
Springer
In a former paper, we defined a new semantics for timed automata, the Almost ASAP semantics, which is parameterized by ∆ to cope with the reaction delay of the controller. We sh...
SAT
2004
Springer
14 years 3 months ago
2004
Springer
The problem of solving boolean combinations of difference constraints is at the core of many important techniques such as planning, scheduling, and model-checking of real-time syst...
CSR
2010
Springer
14 years 3 months ago
2010
Springer
Abstract. We introduce dynamic communicating automata (DCA), an extension of communicating finite-state machines that allows for dynamic creation of processes. Their behavior can ...
CADE
1999
Springer
14 years 2 months ago
1999
Springer
We present a PSpace algorithm that decides satisfiability of the graded modal logic Gr(KR)—a natural extension of propositional modal logic KR by counting expressions—which pl...