id	author	title	date	pages	extension	mime	words	sentences	flesch	summary	cache	txt
cord-026513-3myuf5q2	Feo-Arenis, Sergio	On Implementable Timed Automata	2020-05-13		.txt	text/plain	6874	452	65	In this work, we aim for the generation of distributed code from networks of timed automata with exactly one program per network component (and no other programs, in particular no implicit global scheduler), where all execution times are considered and modelled (including the selection of subsequent edges), and that comes with a comprehensible notion of correctness. For the timing aspect, we propose not to use platform clocks directly in, e.g., edge guards (see related work below) but to turn model clocks into program variables and to assume a "sleep" operation with absolute deadlines on the target platform (cf. For synchronisation transitions of the program, we use the assumption that the considered network of implementable timed automata does not depend on a global scheduler, in particular that send actions are never blocked, or, in other words, that whenever a component has a send edge locally enabled, then there is a receiving edge enabled on the same channel.	./cache/cord-026513-3myuf5q2.txt	./txt/cord-026513-3myuf5q2.txt