3653 search results - page 177 / 731 » On Recognizable Timed Languages |
219
click to vote
SIGADA
2007
Springer
15 years 11 months ago
2007
Springer
A system based on a hierarchical scheduler is a system in which the processor is shared between several collaborative schedulers. Such schedulers exist since 1960 and they are bec...
137
click to vote
CIMCA
2008
IEEE
15 years 11 months ago
2008
IEEE
We introduce a language for the representation of a subset of strategic interactions. The representation is based on petri nets. Representable games are restricted to have a fini...
114
click to vote
ICCS
2004
Springer
15 years 10 months ago
2004
Springer
Abstract. Bulk Synchronous Parallel ML or BSML is a functional dataparallel language for programming bulk synchronous parallel (BSP) algorithms. The execution time can be estimated...
160
click to vote
TSE
2008
15 years 5 months ago
2008
Timed Automata have proven to be useful for specification and verification of real-time systems. System design using Timed Automata relies on explicit manipulation of clock variabl...
145
click to vote
ICALP
2009
Springer
16 years 5 months ago
2009
Springer
In this paper, we propose an abstract procedure which, given a timed automaton, produces a language-equivalent deterministic infinite timed tree. We prove that under a certain boun...