Sciweavers

504 search results - page 73 / 101
» Complexity Properties of Restricted Abstract Argument System...
Sort
View
TACAS
2005
Springer
129views Algorithms» more  TACAS 2005»
14 years 1 months ago
A New Algorithm for Strategy Synthesis in LTL Games
Abstract. The automatic synthesis of programs from their specifications has been a dream of many researchers for decades. If we restrict to open finite-state reactive systems, th...
Aidan Harding, Mark Ryan, Pierre-Yves Schobbens
WORDS
2005
IEEE
14 years 1 months ago
Virtual Networks in an Integrated Time-Triggered Architecture
Depending on the physical structuring of large distributed safety-critical real-time systems, one can distinguish federated and integrated system architectures. This paper investi...
Roman Obermaisser, Philipp Peti, Hermann Kopetz
RV
2010
Springer
177views Hardware» more  RV 2010»
13 years 6 months ago
Runtime Instrumentation for Precise Flow-Sensitive Type Analysis
We describe a combination of runtime information and static analysis for checking properties of complex and configurable systems. The basic idea of our approach is to 1) let the p...
Etienne Kneuss, Philippe Suter, Viktor Kuncak
JAC
2008
13 years 9 months ago
Rule 110: universality and catenations
Cellular automata are a simple model of parallel computation. Many people wonder about the computing power of such a model. Following an idea of S. Wolfram [16], M. Cook [3] has pr...
Gaétan Richard
CORR
2007
Springer
132views Education» more  CORR 2007»
13 years 7 months ago
On Compact Routing for the Internet
The Internet’s routing system is facing stresses due to its poor fundamental scaling properties. Compact routing is a research field that studies fundamental limits of routing ...
Dmitri V. Krioukov, Kimberly C. Claffy, Kevin R. F...