Sciweavers

620 search results - page 114 / 124
» Algorithms and computations on cellular automata
Sort
View
FORMATS
2010
Springer
13 years 6 months ago
Combining Symbolic Representations for Solving Timed Games
We present a general approach to combine symbolic state space representations for the discrete and continuous parts in the synthesis of winning strategies for timed reachability ga...
Rüdiger Ehlers, Robert Mattmüller, Hans-...
ICST
2009
IEEE
13 years 6 months ago
Timed Testing under Partial Observability
This paper studies the problem of model-based testing of real-time systems that are only partially observable. We model the System Under Test (SUT) using Timed Game Automata (TGA)...
Alexandre David, Kim Guldstrand Larsen, Shuhao Li,...
FOSSACS
2009
Springer
14 years 3 months ago
Facets of Synthesis: Revisiting Church's Problem
In this essay we discuss the origin, central results, and some perspectives of algorithmic synthesis of nonterminating reactive programs. We recall the fundamental questions raised...
Wolfgang Thomas
BMCBI
2010
142views more  BMCBI 2010»
13 years 8 months ago
Discover Protein Complexes in Protein-Protein Interaction Networks Using Parametric Local Modularity
Background: Recent advances in proteomic technologies have enabled us to create detailed protein-protein interaction maps in multiple species and in both normal and diseased cells...
Jongkwang Kim, Kai Tan
BMCBI
2008
153views more  BMCBI 2008»
13 years 8 months ago
Estimating the size of the solution space of metabolic networks
Background: Cellular metabolism is one of the most investigated system of biological interactions. While the topological nature of individual reactions and pathways in the network...
Alfredo Braunstein, Roberto Mulet, Andrea Pagnani