921 search results - page 123 / 185 » On Interleaving in Timed Automata |
101
click to vote
ACSD
2005
IEEE
15 years 5 months ago
2005
IEEE
Asynchronous data communication mechanisms (ACMs) have been extensively studied as data connectors between independently timed processes in digital systems. In previous work, syst...
FSTTCS
1998
Springer
15 years 4 months ago
1998
Springer
Partial order methods have been introduced to avoid the state explosion problem in veri cation resulting from the representation of multiple interleavings of concurrent transitions...
ECAI
2004
Springer
15 years 3 months ago
2004
Springer
Abstract. We investigate different evaluation strategies for planning problems represented as constraint satisfaction or satisfiability problems. The standard evaluation strategy, ...
102
click to vote
ASIACRYPT
2001
Springer
15 years 3 months ago
2001
Springer
Abstract. In this paper, we consider the problem of mutually authenticated key exchanges between a low-power client and a powerful server. We show how the Jakobsson-Pointcheval sch...
100
click to vote
AAAI
2008
15 years 2 months ago
2008
We present the first planner capable of reasoning with both the full semantics of PDDL2.1 (level 3) temporal planning and with numeric resources. Our planner, CRIKEY3, employs heu...