846 search results - page 84 / 170 » On the Computational Complexity of Spatio-Temporal Logics |
107
Voted
CONCUR
2009
Springer
15 years 4 months ago
2009
Springer
Abstract. We study the decidability and complexity of verification problems for timed automata over time intervals of fixed, bounded length. One of our main results is that time-bo...
125
Voted
SPIN
2000
Springer
15 years 4 months ago
2000
Springer
The Temporal Rover is a specification based verification tool for applications written in C, C++, Java, Verilog and VHDL. The tool combines formal specification, using Linear-Time ...
122
click to vote
SPE
2002
15 years 11 days ago
2002
This study presents a practical solution for data collection and restoration to migrate a process written in high level stack-based languages such as C and Fortran over a network ...
133
Voted
ACL
2010
14 years 10 months ago
2010
Open-ended spoken interactions are typically characterised by both structural complexity and high levels of uncertainty, making dialogue management in such settings a particularly...
89
Voted
ICCAD
2004
IEEE
15 years 9 months ago
2004
IEEE
Polynomial expressions are used to compute a wide variety of mathematical functions commonly found in signal processing and graphics applications, which provide good opportunities...