A compositional method for the synthesis of asynchronous communication mechanisms

Authors:
Kyller Gorgônio;Jordi Cortadella;Fei Xia
Affiliations:
Embedded Systems and Pervasive Computing Laboratory, Federal University of Campina Grande, Brazil;Department of Software, Universitat Politècnica de Catalunya, Spain;School of Electrical, Electronic and Computer Engineering, University of Newcastle upon Tyne, UK
Venue:
ICATPN'07 Proceedings of the 28th international conference on Applications and theory of Petri nets and other models of concurrency
Year:
2007

Citing 4
Cited 0

Advanced programming in the UNIX environment

Advanced programming in the UNIX environment
The PEP Tool

CAV '97 Proceedings of the 9th International Conference on Computer Aided Verification
Buffered Asynchronous Communication Mechanisms

ACSD '04 Proceedings of the Fourth International Conference on Application of Concurrency to System Design
Automating Synthesis of Asynchronous Communication Mechanisms

ACSD '05 Proceedings of the Fifth International Conference on Application of Concurrency to System Design

Quantified Score

Hi-index	0.00

Visualization

Abstract

Asynchronous data communication mechanisms (ACMs) have been extensively studied as data connectors between independently timed concurrent processes. In previous work, an automatic ACM synthesis method based on the generation of the reachability graph and the theory of regions was proposed. In this paper, we propose a new synthesis method based on the composition of Petri net modules, avoiding the exploration of the reachability graph. The behavior of ACMs is formally defined and correctness properties are specified in CTL. Model checking is used to verify the correctness of the Petri net models. The algorithms to generate the Petri net models are presented. Finally, a method to automatically generate C++ source code from the Petri net model is described.