On Generating Soft Real-Time Programs for Non-Real-Time Environments

Senthooran, Ilankaikone; Watanabe, Takahiro

doi:10.1007/978-4-431-54436-4_1

Search citation statements

Order By: Relevance

Paper Sections

Select...

Introduction1

Citation Types

Supporting

Mentioning

Contrasting

Year Published

2020

Publication Types

Select...

Book1

Relationship

Self Cite0

Independent1

Authors

Journals

Cited by 1 publication

(1 citation statement)

References 10 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Generating code for timed systems from timed automata models has been approached before [3,4,20,25,29]. All these works also generate code for a scheduler (as an additional, explicit component) that corresponds to the implicit, global scheduler introduced by the timed automata semantics [5].…”

Section: Introductionmentioning

confidence: 99%

On Implementable Timed Automata

Feo-Arenis¹,

Vujinović²,

Westphal³

2020

Formal Techniques for Distributed Objects, Components, and Systems

View full text Add to dashboard Cite

Generating code from networks of timed automata is a wellresearched topic with many proposed approaches, which have in common that they not only generate code for the processes in the network, but necessarily generate additional code for a global scheduler which implements the timed automata semantics. For distributed systems without shared memory, this additional component is, in general, undesired.In this work, we present a new approach to the generation of correct code (without global scheduler) for distributed systems without shared memory yet with (almost) synchronous clocks if the source model does not depend on a global scheduler. We characterise a set of implementable timed automata models and provide a translation to a timed while language. We show that each computation of the generated program has a network computation path with the same observable behaviour.

show abstract

Section: Introductionmentioning

confidence: 99%