3653 search results - page 278 / 731 » On Recognizable Timed Languages |
231
click to vote
ENTCS
2006
15 years 7 months ago
2006
We present a stochastic version of Concurrent Constraint Programming (CCP), where we associate a rate to each basic instruction that interacts with the constraint store. We give a...
182
click to vote
FAC
2002
15 years 7 months ago
2002
Formal methods can be used in effective combination only if the semantic links between individual methods are clearly established. This paper discusses the semantic design of TCOZ,...
142
click to vote
FUIN
2002
15 years 7 months ago
2002
We study caterpillar tree automata [3] that are restricted to enter any subtree at most one time (or k times). We show that, somewhat surprisingly, the deterministic one-visit aut...
198
click to vote
STTT
2010
15 years 2 months ago
2010
We present a model of the IEEE 1394 Root Contention Protocol with a proof of Safety. This model has real-time properties which are expressed in the language of the event B method: ...
229
click to vote
IEEEPACT
2006
IEEE
16 years 1 months ago
2006
IEEE
This paper describes a compiler for stream programs that efficiently schedules computational kernels and stream memory operations, and allocates on-chip storage. Our compiler uses...