Sciweavers

43264 search results - page 8332 / 8653
» Comparing models of computation
Sort
View
ICST
2009
IEEE
15 years 24 days 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,...
AMAI
2010
Springer
15 years 16 days ago
Interval-valued soft constraint problems
Constraints and quantitative preferences, or costs, are very useful for modelling many real-life problems. However, in many settings, it is difficult to specify precise preference ...
Mirco Gelain, Maria Silvia Pini, Francesca Rossi, ...
DEBU
2010
128views more  DEBU 2010»
15 years 14 days ago
Panda: A System for Provenance and Data
Panda (for Provenance and Data) is a new project whose goal is to develop a general-purpose system that unifies concepts from existing provenance systems and overcomes some limita...
Robert Ikeda, Jennifer Widom
DMTCS
2010
137views Mathematics» more  DMTCS 2010»
15 years 14 days ago
Deterministic recognizability of picture languages with Wang automata
We present a model of automaton for picture language recognition, called Wang automaton, which is based on labeled Wang tiles. Wang automata combine features of both online tessell...
Violetta Lonati, Matteo Pradella
FCSC
2010
170views more  FCSC 2010»
15 years 14 days ago
Formal verification of concurrent programs with read-write locks
Abstract Read-write locking is an important mechanism to improve concurrent granularity, but it is difficult to reason about the safety of concurrent programs with read-write locks...
Ming Fu, Yu Zhang, Yong Li
« Prev « First page 8332 / 8653 Last » Next »