3653 search results - page 237 / 731 » On Recognizable Timed Languages |
175
click to vote
FOCS
1995
IEEE
15 years 10 months ago
1995
IEEE
We prove that if strong pseudorandom number generators exist, then the class of languages that have polynomialsized circuits (P/poly) is not measurable within exponential time, in...
286
click to vote
IFIP
2004
Springer
16 years 18 days ago
2004
Springer
Abstract The Firing Squad Synchronization Problem is one of the classical problems for cellular automata. In this paper we consider the case of more than one general. A synchronous...
169
click to vote
ERSHOV
2006
Springer
15 years 11 months ago
2006
Springer
Abstract. TTCN-3 is a standardized language for specifying and executing test suites that is particularly popular for testing embedded systems. Prior to testing embedded software i...
182
click to vote
DAGSTUHL
2004
15 years 8 months ago
2004
This paper describes a solution for bus scheduling of distributed multi-mode TDL (Timing Definition Language) components. The TDL component model is based on the concept of Logical...
222
click to vote
SDL
2001
15 years 8 months ago
2001
Abstract. We describe an approach for the verification of quantitative temporal properties of SDL specifications, which adapts techniques developed for timed automata [2]. With res...