Sciweavers

3653 search results - page 57 / 731
» On Recognizable Timed Languages
Sort
View
ENTCS
2006
114views more  ENTCS 2006»
14 years 9 months ago
Run-Time Checking of Dynamic Properties
We consider a first-order property specification language for run-time monitoring of dynamic systems. The language is based on a linear-time temporal logic and offers two kinds of...
Oleg Sokolsky, Usa Sammapun, Insup Lee, Jesung Kim
FPCA
1989
15 years 1 months ago
Automatic Complexity Analysis
One way to analyse programs is to to derive expressions for their computational behaviour. A time bound function (or worst-case complexity) gives an upper bound for the computatio...
Mads Rosendahl
IDEAS
2010
IEEE
141views Database» more  IDEAS 2010»
14 years 7 months ago
Modeling synchronized time series
Abstract. We consider the class of applications that manage time series (TS) and propose a data model and a query language that let these applications manipulate TS data sets at a ...
Zoé Faget, Philippe Rigaux, David Gross-Amb...
APSEC
2009
IEEE
14 years 7 months ago
A Formal Framework to Integrate Timed Security Rules within a TEFSM-Based System Specification
Abstract--Formal methods are very useful in software industry and are becoming of paramount importance in practical engineering techniques. They involve the design and the modeling...
Wissam Mallouli, Amel Mammar, Ana R. Cavalli
FCT
2001
Springer
15 years 2 months ago
Polynomial Time Algorithms for Finding Unordered Tree Patterns with Internal Variables
Many documents such as Web documents or XML files have tree structures. A term tree is an unordered tree pattern consisting of internal variables and tree structures. In order to ...
Takayoshi Shoudai, Tomoyuki Uchida, Tetsuhiro Miya...