Abstract
In distributed systems, the order in which the messages are received by the processes is crucial to ensure the expected behavior. This paper presents a communication model which allows for restrictions on the deliveries of a channel depending on the availability of messages in other channels. This corresponds to prioritizing some channels over others. It relies on a framework able to verify if a given system satisfies a user defined LTL (Linear Temporal Logic) property with different priorities. We also propose to automatically infer the channel priorities so that the system does not infringe on this temporal property.
This work was partially supported by project PARDI ANR-16-CE25-0006. An extended version of the paper is available at http://vacs.enseeiht.fr/dcai17-long.pdf.
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
1. Jos C. M. Baeten, Jan A. Bergstra, and Jan Willem Klop. Syntax and defining equations for an interrupt mechanism in process algebra. Fundamenta Informaticae, IX:127–168, 1986.
2. Falko Bause. Analysis of Petri nets with a dynamic priority method. In 18th International Conference on Application and Theory of Petri Nets ICATPN’97, volume 1248 of Lecture Notes in Computer Science, pages 215–234. Springer, 1997.
3. Eike Best and Maciej Koutny. Petri net semantics of priority systems. Theoretical Computer Science, 96(1):175–174, 1992.
4. Juanito Camilleri and Glynn Winskel. CCS with priority choice. Information and Computation, 116(1):26–37, 1995.
5. Bernadette Charron-Bost, Friedemann Mattern, and Gerard Tel. Synchronous, asynchronous, and causally ordered communication. Distributed Computing, 9(4):173–191, February 1996.
6. Florent Chevrou, Aurélie Hurault, and Philippe Quéinnec. Automated verification of asynchronous communicating systems with TLA+. Electronic Communications of the EASST (special issue AVOCS’15), 72:1–15, 2015.
7. Florent Chevrou, Aurélie Hurault, and Philippe Quéinnec. On the diversity of asynchronous communication. Formal Aspects of Computing, 28(5):847–879, 2016.
8. Edmund M. Clarke and E. Allen Emerson. Design and synthesis of synchronization skeletons using branching-time temporal logic. In Logics of Programs, volume 131 of Lecture Notes in Computer Science, pages 52–71. Springer, 1981.
9. Rance Cleaveland and Matthew Hennessy. Priorities in process algebras. Information and Computation, 87(1/2):58–77, 1990.
10. George Coulouris, Jean Dollimore, and Tim Kindberg. Distributed Systems: concepts and design. Addison Wesley, second edition, 1994.
11. M. Elizabeth C. Hull. Occam - A programming language for multiprocessor systems. Computer Languages, 12(1):27–37, 1987.
12. Ajay D. Kshemkalyani and Mukesh Singhal. Distributed Computing: Principles, Algorithms, and Systems. Cambridge University Press, March 2011.
13. Leslie Lamport. Specifying Systems. Addison Wesley, 2003.
14. K. V. S. Prasad. A calculus of broadcasting systems. Science of Computer Programming, 25(2-3):285–327, 1995.
15. Michel Raynal. Distributed Algorithms for Message-Passing Systems. Springer, 2013.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2018 Springer International Publishing AG
About this paper
Cite this paper
Sensfelder, N., Hurault, A., Quéinnec, P. (2018). Inference of Channel Priorities for Asynchronous Communication. In: Omatu, S., Rodríguez, S., Villarrubia, G., Faria, P., Sitek, P., Prieto, J. (eds) Distributed Computing and Artificial Intelligence, 14th International Conference. DCAI 2017. Advances in Intelligent Systems and Computing, vol 620. Springer, Cham. https://doi.org/10.1007/978-3-319-62410-5_32
Download citation
DOI: https://doi.org/10.1007/978-3-319-62410-5_32
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-62409-9
Online ISBN: 978-3-319-62410-5
eBook Packages: EngineeringEngineering (R0)