Embedding Polychrony into Synchrony

This paper presents an embedding of polychronous programs into synchronous ones. Due to this embedding, it is not only possible to deepen the understanding of these different models of computation, but, more importantly, it is possible to transfer compilation techniques that were developed for synch...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:IEEE transactions on software engineering Jg. 39; H. 7; S. 917 - 929
Hauptverfasser: Brandt, J., Gemunde, M., Schneider, K., Shukla, S. K., Talpin, J-P
Format: Journal Article
Sprache:Englisch
Veröffentlicht: New York IEEE 01.07.2013
IEEE Computer Society
Institute of Electrical and Electronics Engineers
Schlagworte:
Asynchronous
Clocks
Computation
Computation and Language
Computational modeling
Computer Science
Computer simulation
Control systems
Embedded systems
Fertilization
Hardware
Input output
Mathematical models
Model-driven embedded software
Names
polychronous programming
Programming languages
programming models
Specifications
Studies
Synchronization
Synchronous
synchronous guarded commands
synchronous programming
synchrony hypothesis
Unified modeling language
ISSN:0098-5589, 1939-3520
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung:This paper presents an embedding of polychronous programs into synchronous ones. Due to this embedding, it is not only possible to deepen the understanding of these different models of computation, but, more importantly, it is possible to transfer compilation techniques that were developed for synchronous programs to polychronous programs. This transfer is nontrivial because the underlying paradigms differ more than their names suggest: Since synchronous systems react deterministically to given inputs in discrete steps, they are typically used to describe reactive systems with a totally ordered notion of time. In contrast, polychronous system models entail a partially ordered notion of time, and are most suited to interface a system with an asynchronous environment by specifying input/output constraints from which a deterministic controller may eventually be refined and synthesized. As particular examples for the mentioned cross fertilization, we show how a simulator and a verification backend for synchronous programs can be made available to polychronous specifications, which is a first step toward integrating heterogeneous models of computation.
Bibliographie:SourceType-Scholarly Journals-1
ObjectType-Feature-1
content type line 14
ObjectType-Article-2
content type line 23
ISSN:0098-5589
1939-3520
DOI:10.1109/TSE.2012.85