Publication Type

Conference Proceeding Article

Version

publishedVersion

Publication Date

7-2005

Abstract

Given a set of sequence diagrams, the problem of synthesis is of deciding whether there exists a satisfying object system and if so, synthesize one automatically. It is crucial in the development of complex systems, since sequence diagrams serve as the manifestation of use cases and if synthesizable they could lead directly to implementation. It is even more interesting (and harder) if the synthesized object system is distributed. In this paper, we propose a systematic way of synthesizing distributed processes from Live Sequence Charts. The basic idea is to first construct a CSP specification from the LSC specification, and then use CSP algebraic laws to group the behaviors of each object effectively. The key point is that the behaviors of each object can be decided locally without constructing the global state machine.

Keywords

LSC, CSP, Synthesis

Discipline

Programming Languages and Compilers | Software Engineering

Research Areas

Software and Cyber-Physical Systems

Publication

Proceedings of 2005 International Symposium of Formal Methods Europe, Newcastle, UK, July 18-22

First Page

415

Last Page

431

ISBN

9783540278825

Identifier

10.1007/11526841_28

Publisher

Springer Link

City or Country

Newcastle, UK

Additional URL

https://doi.org/10.1007/11526841_28

Download

Share

COinS