Sciweavers

2632 search results - page 71 / 527
» Alternating Timed Automata
Sort
View
IANDC
2006
83views more  IANDC 2006»
15 years 1 months ago
Implicit complexity over an arbitrary structure: Quantifier alternations
We provide machine-independent characterizations of some complexity classes, over an arbitrary structure, in the model of computation proposed by L. Blum, M. Shub and S. Smale. We...
Olivier Bournez, Felipe Cucker, Paulin Jacob&eacut...
CONCUR
1997
Springer
15 years 5 months ago
Reachability Analysis of Pushdown Automata: Application to Model-Checking
We apply the symbolic analysis principle to pushdown systems. We represent (possibly in nite) sets of con gurations of such systems by means of nite-state automata. In order to re...
Ahmed Bouajjani, Javier Esparza, Oded Maler
ICDT
2010
ACM
259views Database» more  ICDT 2010»
15 years 11 months ago
Forward-XPath and extended register automata on data-trees
We consider a fragment of XPath named `forward-XPath', which contains all descendant and rightwards sibling axes as well as data equality and inequality tests. The satisfiabi...
Diego Figueira
RTCSA
2008
IEEE
15 years 7 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...
MAM
2008
138views more  MAM 2008»
15 years 1 months ago
FPGA based tester tool for hybrid real-time systems
This paper presents a design methodology for a hybrid Hardwarein-the-Loop (HIL) tester tool, based on both discrete event system theory, given by timed automata, and continuous sy...
Jan Krakora, Zdenek Hanzálek