Bounded Determinization of Timed Automata with Silent Transitions

Deterministic timed automata are strictly less expressive than their non-deterministic counterparts, which are again less expressive than those with silent transitions. As a consequence, timed automata are in general non-determinizable. This is unfortunate since deterministic automata play a major role in model-based testing, observability and implementability. However, by bounding the length of the traces in the automaton, effective determinization becomes possible. We propose a novel procedure for bounded determinization of timed automata. The procedure unfolds the automata to bounded trees, removes all silent transitions and determinizes via disjunction of guards. The proposed algorithms are optimized to the bounded setting and thus are more efficient and can handle a larger class of timed automata than the general algorithms. The approach is implemented in a prototype tool and evaluated on several examples. To our best knowledge, this is the first implementation of this type of procedure for timed automata.Comment: 25 page

The ethics of machine translation

In this paper I first describe the two main branches in machine translation research. I then go to discuss why the second of these, statistical machine translation, can cause some malaise among translation scholars. As some of the issues that arise are ethical in nature, I stop to ponder what an ethics of machine translation might involve, before considering the ethical stance adopted by some of the main protagonists in the development and popularisation of statistical machine translation, and in the teaching of translation

School use of learning platforms and associated technologies - case study: primary school 1

Study of benefits and effective use of learning platforms in schools based on 12 case studie