221 search results - page 14 / 45 » From MITL to Timed Automata |
104
click to vote
CAV
2004
Springer
15 years 3 months ago
2004
Springer
Abstract. We extend the automata-theoretic framework for reasoning about infinitestate sequential systems to handle also the global model-checking problem. Our framework is based o...
126
click to vote
IWPT
2001
15 years 1 months ago
2001
We define a new model of automata for the description of bidirectional parsing strategies for tree adjoining grammars and a tabulation mechanism that allow them to be executed in ...
ACL
1998
15 years 1 months ago
1998
The paper presents a tabular interpretation for a kind of 2-Stack Automata. These automata may be used to describe various parsing strategies, ranging from purely top-down to pure...
103
click to vote
RTCSA
2008
IEEE
15 years 6 months ago
2008
IEEE
COMDES-II is a component-based software framework intended for Model Integrated Computing (MIC) of embedded control systems with hard real-time constraints. We present a transforma...
COCO
2000
Springer
15 years 3 months ago
2000
Springer
We consider the problem of testing whether the intersection of a collection of k automata is empty. The straightforward algorithm for solving this problem runs in time k where is...