Sciweavers

5015 search results - page 288 / 1003
» Model Checking a Path
Sort
View
COMPGEOM
2005
ACM
15 years 8 months ago
Shortest path amidst disc obstacles is computable
An open question in Exact Geometric Computation is whether there are transcendental computations that can be made “geometrically exact”. Perhaps the simplest such problem in c...
Ee-Chien Chang, Sung Woo Choi, DoYong Kwon, Hyungj...
DFG
2004
Springer
15 years 10 months ago
Verification of PLC Programs Given as Sequential Function Charts
Programmable Logic Controllers (PLC) are widespread in the manufacturing and processing industries to realize sequential procedures and to avoid safety-critical states. For the spe...
Nanette Bauer, Sebastian Engell, Ralf Huuck, Sven ...
QEST
2010
IEEE
15 years 4 months ago
Rare Event Simulation for Highly Dependable Systems with Fast Repairs
Stochastic model checking has been used recently to assess, among others, dependability measures for a variety of systems. However, the employed numerical methods, as, e.g., suppor...
Daniël Reijsbergen, Pieter-Tjerk de Boer, Wer...
WDAG
2007
Springer
125views Algorithms» more  WDAG 2007»
16 years 18 days ago
Approximating Wardrop Equilibria with Finitely Many Agents
We study adaptive routing algorithms in a round-based model. Suppose we are given a network equipped with load-dependent latency functions on the edges and a set of commodities eac...
Simon Fischer, Lars Olbrich, Berthold Vöcking
PODC
2003
ACM
15 years 11 months ago
Adapting to a reliable network path
We consider the model of unreliable network links, where at each time unit a link might be either up or down. We consider two related problems. The first, establishing end to end...
Baruch Awerbuch, Yishay Mansour