Sciweavers

513 search results - page 28 / 103
» Finitely Based, Finite Sets of Words
Sort
View
DSRT
2008
IEEE
14 years 3 months ago
Modeling System Security Rules with Time Constraints Using Timed Extended Finite State Machines
Security and reliability are of paramount importance in designing and building real-time systems because any security failure can put the public and the environment at risk. In th...
Wissam Mallouli, Amel Mammar, Ana R. Cavalli
DSVIS
2003
Springer
14 years 1 months ago
Applying Extended Finite State Machines in Software Testing of Interactive Systems
Model Based Testing (MBT) is a functional testing technique that makes use of information from behavioral models of the software to carry out the testing task. This technique has b...
Marcelo Fantinato, Mario Jino
CORR
2006
Springer
90views Education» more  CORR 2006»
13 years 8 months ago
The recognizability of sets of graphs is a robust property
Once the set of finite graphs is equipped with an algebra structure (arising from the definition of operations that generalize the concatenation of words), one can define the noti...
Bruno Courcelle, Pascal Weil
TSP
2008
166views more  TSP 2008»
13 years 8 months ago
Nonuniform Sampling of Periodic Bandlimited Signals
Abstract--Digital processing techniques are based on representing a continuous-time signal by a discrete set of samples. This paper treats the problem of reconstructing a periodic ...
E. Margolis, Yonina C. Eldar
CORR
2010
Springer
124views Education» more  CORR 2010»
13 years 8 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