We show that any regular set of basic MSCs can be implemented by a deadlock-free communicating finite-state machine with local termination: Processes stop in local dead-states independently from the contents of channels and the local states of other processes. We present a self-contained, direct, and relatively simple construction based on a new notion called context MSC. © Springer-Verlag Berlin Heidelberg 2007.
CITATION STYLE
Baudru, N., & Morin, R. (2007). Synthesis of safe message-passing systems. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 4855 LNCS, pp. 277–289). Springer Verlag. https://doi.org/10.1007/978-3-540-77050-3_23
Mendeley helps you to discover research relevant for your work.