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.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Cortadella, J., Gorgônio, K., Xia, F., Yakovlev, A.: Automating synthesis of asynchronous communication mechanisms. In: ACSD’05. Proceedings of the Fifth International Conference on Application of Concurrency to System Design, St. Malo, France, June 2005, pp. 166–175. IEEE Computer Society, Washington (2005)
Fassino, J.-P.: THINK: vers une architecture de systèmes flexibles. PhD thesis, École Nationale Supérieure des Télécommunications (December 2001)
Grahlmann, B.: The pep tool. In: Grumberg, O. (ed.) CAV 1997. LNCS, vol. 1254, pp. 440–443. Springer, Heidelberg (1997)
Lamport, L.: On interprocess communication — parts I and II. Distributed Computing 1(2), 77–101 (1986)
McMillan, K.L.: The SMV System: for SMV version 2.5.4 (November 2000) Available from http://www-2.cs.cmu.edu/~modelcheck/smv/smvmanual.ps.gz
Simpson, H.R.: Protocols for process interaction. IEE Proceedings on Computers and Digital Techniques 150(3), 157–182 (2003)
Richard Stevens, W.: Advanced programming in the UNIX environment. Addison Wesley Longman Publishing Co., Inc, Redwood City, CA (1992)
Xia, F., Hao, F., Clark, I., Yakovlev, A., Chester, G.: Buffered asynchronous communication mechanisms. In: ACSD’04. Proceedings of the Fourth International Conference on Application of Concurrency to System Design, pp. 36–44. IEEE Computer Society Press, Washington (2004)
Yakovlev, A., Kinniment, D. J., Xia, F., Koelmans, A. M.: A fifo buffer with non-blocking interface. TCVLSI Technical Bulletin, pp. 11–14, Fall (1998)
Yakovlev, A., Xia, F.: Towards synthesis of asynchronous communication algorithms. In: Caillaud, B., Darondean, P., Lavagno, L., Xie, X. (eds.) Synthesis and Control of Discrete Event Systems. Part I: Decentralized Systems and Control, pp. 53–75. Kluwer Academic Publishers, Boston (2002)
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 2007 Springer Berlin Heidelberg
About this paper
Cite this paper
Gorgônio, K., Cortadella, J., Xia, F. (2007). A Compositional Method for the Synthesis of Asynchronous Communication Mechanisms. In: Kleijn, J., Yakovlev, A. (eds) Petri Nets and Other Models of Concurrency – ICATPN 2007. ICATPN 2007. Lecture Notes in Computer Science, vol 4546. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-73094-1_11
Download citation
DOI: https://doi.org/10.1007/978-3-540-73094-1_11
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-73093-4
Online ISBN: 978-3-540-73094-1
eBook Packages: Computer ScienceComputer Science (R0)