Synthesis of safe message-passing systems

Authors:
Nicolas Baudru;Rémi Morin
Affiliations:
Aix-Marseille Universités, UMR, CNRS, Laboratoire d'Informatique Fondamentale de Marseille, Marseille Cedex 9, France;Aix-Marseille Universités, UMR, CNRS, Laboratoire d'Informatique Fondamentale de Marseille, Marseille Cedex 9, France
Venue:
FSTTCS'07 Proceedings of the 27th international conference on Foundations of software technology and theoretical computer science
Year:
2007

Citing 11
Cited 1

Recognizable languages in concurrency monoids

Theoretical Computer Science
Representation of computations in concurrent automata by dependence orders

Theoretical Computer Science
The Book of Traces

The Book of Traces
Bounded time-stamping in message-passing systems

Theoretical Computer Science
Safe Executions of Recognizable Trace Languages by Asynchronous Automata

Proceedings of the Symposium on Logical Foundations of Computer Science: Logic at Botik '89
Regular sets of infinite message sequence charts

Information and Computation
Realizability and verification of MSC graphs

Theoretical Computer Science - Automata, languages and programming
Infinite-state high-level MSCs: Model-checking and realizability

Journal of Computer and System Sciences
Message-passing automata are expressively equivalent to EMSO logic

Theoretical Computer Science - Concurrency theory (CONCUR 2004)
A theory of regular MSC languages

Information and Computation
A Kleene theorem and model checking algorithms for existentially bounded communicating automata

Information and Computation

Scenario realizability with constraint optimization

FASE'13 Proceedings of the 16th international conference on Fundamental Approaches to Software Engineering

Quantified Score

Hi-index	0.00

Visualization

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.