878 search results - page 91 / 176 » Modelling Communicating Agents in Timed Reasoning Logics |
180
click to vote
IAT
2005
IEEE
15 years 12 months ago
2005
IEEE
In this paper, we consider the problem of dynamic lightpath protection in survivable WDM networks with single link failure model. Our work concerns in how to dynamically determine...
199
click to vote
CONCUR
1999
Springer
15 years 10 months ago
1999
Springer
Abstract. The paper presents a partial order reduction method applicable to networks of timed automata. The advantage of the method is that it reduces both the number of explored c...
169
click to vote
ESOP
2000
Springer
15 years 10 months ago
2000
Springer
Abstract. We show how a program analysis technique originally developed for C-like pointer structures can be adapted to analyse the hierarchical structure of processes in the ambie...
180
click to vote
JCST
2010
15 years 1 months ago
2010
Probabilistic techniques are widely used in the analysis of algorithms to estimate the computational complexity of algorithms or a computational problem. Traditionally, such analys...
193
click to vote
IPPS
2006
IEEE
16 years 11 days ago
2006
IEEE
Advanced wireless sensor network algorithms pose challenges to their formal modeling and analysis, such as modeling probabilistic and real-time behaviors and novel forms of commun...