Sciweavers

3991 search results - page 218 / 799
» Bounding homogeneous models
Sort
View
MFCS
2005
Springer
14 years 1 months ago
The Complexity of Model Checking Higher Order Fixpoint Logic
This paper analyses the computational complexity of the model checking problem for Higher Order Fixpoint Logic – the modal µ-calculus enriched with a typed λ-calculus. It is ha...
Martin Lange, Rafal Somla
APPROX
2010
Springer
150views Algorithms» more  APPROX 2010»
13 years 8 months ago
Reconstruction Threshold for the Hardcore Model
In this paper we consider the reconstruction problem on the tree for the hardcore model. We determine new bounds for the non-reconstruction regime on the k-regular tree showing non...
Nayantara Bhatnagar, Allan Sly, Prasad Tetali
AUTOMATICA
2005
69views more  AUTOMATICA 2005»
13 years 8 months ago
Model reduction of periodic systems: a lifting approach
This note furthers existing results on the model reduction of stable periodic systems. It utilizes for that matter a lifting technique to potentially attain less conservative erro...
Mazen Farhood, Carolyn L. Beck, Geir E. Dullerud
EMSOFT
2006
Springer
13 years 12 months ago
Modeling a system controller for timing analysis
Upper bounds on worst-case execution times, which are commonly called WCET, are a prerequisite for validating the temporal correctness of tasks in a real-time system. Due to the e...
Stephan Thesing
INFOCOM
2002
IEEE
14 years 1 months ago
Real-time Model and Convergence Time of BGP
—BGP allows routers to use general preference policies for route selection. This paper studies the impact of these policies on convergence time. We first describe a real-time mo...
Davor Obradovic