Sciweavers

77 search results - page 15 / 16
» Polynomial Interrupt Timed Automata
Sort
View
AAAI
2006
13 years 7 months ago
DNNF-based Belief State Estimation
As embedded systems grow increasingly complex, there is a pressing need for diagnosing and monitoring capabilities that estimate the system state robustly. This paper is based on ...
Paul Elliott, Brian C. Williams
TCS
2002
13 years 5 months ago
Binary (generalized) Post Correspondence Problem
An instance of the (Generalized) Post Correspondence Problem is during the decision process typically reduced to one or more other instances, called its successors. In this paper ...
Vesa Halava, Tero Harju, Mika Hirvensalo
SIAMCOMP
2010
83views more  SIAMCOMP 2010»
13 years 4 months ago
Reaching and Distinguishing States of Distributed Systems
Some systems interact with their environment at physically distributed interfaces, called ports, and in testing such a system it is normal to place a tester at each port. Each test...
Robert M. Hierons
CORR
2009
Springer
242views Education» more  CORR 2009»
13 years 3 months ago
Adaptive Scheduling of Data Paths using Uppaal Tiga
Abstract. We apply Uppaal Tiga to automatically compute adaptive scheduling strategies for an industrial case study dealing with a state-of-the-art image processing pipeline of a p...
Israa AlAttili, Fred Houben, Georgeta Igna, Steffe...
FSTTCS
2008
Springer
13 years 6 months ago
Banach-Mazur Games on Graphs
We survey determinacy, definability, and complexity issues of Banach-Mazur games on finite and infinite graphs. Infinite games where two players take turns to move a token thro...
Erich Grädel