Synthesis of safe message-passing systems

6Citations
Citations of this article
3Readers
Mendeley users who have this article in their library.
Get full text

Abstract

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.

Cite

CITATION STYLE

APA

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

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free