Correct-by-Construction Asynchronous Implementation of Modular Synchronous Specifications

Authors:
Dumitru Potop-Butucaru;Benoit Caillaud
Affiliations:
IRISA, campus universitaire de Beaulieu;IRISA, campus universitaire de Beaulieu
Venue:
ACSD '05 Proceedings of the Fifth International Conference on Application of Concurrency to System Design
Year:
2005

Citing 0
Cited 9

Tag machines

Proceedings of the 5th ACM international conference on Embedded software
From multi-clocked synchronous processes to latency-insensitive modules

Proceedings of the 5th ACM international conference on Embedded software
Polychronous mode automata

EMSOFT '06 Proceedings of the 6th ACM & IEEE International conference on Embedded software
A synchronization algorithm for local temporal refinements in perfectly synchronous models with nested feedback loops

Proceedings of the 17th ACM Great Lakes symposium on VLSI
Synchronization after design refinements with sensitive delay elements

CODES+ISSS '07 Proceedings of the 5th IEEE/ACM international conference on Hardware/software codesign and system synthesis
Composing heterogeneous reactive systems

ACM Transactions on Embedded Computing Systems (TECS)
An Analysis of the Composition of Synchronous Systems

Electronic Notes in Theoretical Computer Science (ENTCS)
Moving from Weakly Endochronous Systems to Delay-Insensitive Circuits

Electronic Notes in Theoretical Computer Science (ENTCS)
From Concurrent Multi-clock Programs to Deterministic Asynchronous Implementations

Fundamenta Informaticae - Application of Concurrency to System Design, the Eighth Special Issue

Quantified Score

Hi-index	0.00

Visualization

Abstract

We introduce a model for the representation of asynchronous implementations of synchronous specifications. The model covers classical implementations, where a notion of global synchronization is preserved by means of signaling, and globally asynchronous, locally synchronous (GALS) implementations where the global clock is removed. Our model offers a unifiedframework for reasoning about two essential correctness properties of an implementation: the preservation of semantics and the absence of deadlocks.