Sciweavers

221 search results - page 14 / 45
» From MITL to Timed Automata
Sort
View
CAV
2004
Springer
130views Hardware» more  CAV 2004»
13 years 11 months ago
Global Model-Checking of Infinite-State Systems
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...
Nir Piterman, Moshe Y. Vardi
IWPT
2001
13 years 8 months ago
Bidirectional Automata for Tree Adjoining Grammars
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 ...
Miguel A. Alonso, Víctor J. Díaz, Ma...
ACL
1998
13 years 8 months ago
A Tabular Interpretation of a Class of 2-Stack Automata
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...
Eric Villemonte de la Clergerie, Miguel A. Alonso
RTCSA
2008
IEEE
14 years 1 months ago
Verification of COMDES-II Systems Using UPPAAL with Model Transformation
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...
Xu Ke, Paul Pettersson, Krzysztof Sierszecki, Chri...
COCO
2000
Springer
107views Algorithms» more  COCO 2000»
13 years 11 months ago
On the Complexity of Intersecting Finite State Automata
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...
George Karakostas, Richard J. Lipton, Anastasios V...