Sciweavers

5084 search results - page 144 / 1017
» Proving Possibility Properties
Sort
View
ASE
2005
103views more  ASE 2005»
15 years 5 months ago
Component Verification with Automatically Generated Assumptions
Abstract. Model checking is an automated technique that can be used to determine whether a system satisfies certain required properties. The typical approach to verifying propertie...
Dimitra Giannakopoulou, Corina S. Pasareanu, Howar...
CONCUR
2006
Springer
15 years 9 months ago
Controller Synthesis for MTL Specifications
Abstract. We consider the control problem for timed automata against specifications given as MTL formulas. The logic MTL is a linear-time timed temporal logic which extends LTL wit...
Patricia Bouyer, Laura Bozzelli, Fabrice Chevalier
DCC
2010
IEEE
16 years 15 days ago
On the Systematic Measurement Matrix for Compressed Sensing in the Presence of Gross Errors
Inspired by syndrome source coding using linear error-correcting codes, we explore a new form of measurement matrix for compressed sensing. The proposed matrix is constructed in t...
Zhi Li, Feng Wu, John Wright
AAECC
2008
Springer
110views Algorithms» more  AAECC 2008»
15 years 5 months ago
Adding constants to string rewriting
We consider unary term rewriting, i.e., term rewriting with unary signatures where all function symbols are either unary or constants. Terms over such signatures can be transformed...
René Thiemann, Hans Zantema, Jürgen Gi...
149
Voted
CORR
2010
Springer
124views Education» more  CORR 2010»
15 years 5 months ago
On Omega Context Free Languages which are Borel Sets of Infinite Rank
This paper is a continuation of the study of topological properties of omega context free languages (-CFL). We proved in [Topological Properties of Omega Context Free Languages, T...
Olivier Finkel