Please use this identifier to cite or link to this item:
|Title:||Synthesis of distributed processes from scenario-based specifications|
|Authors:||Sun, J. |
|Citation:||Sun, J.,Dong, J.S. (2005). Synthesis of distributed processes from scenario-based specifications. Lecture Notes in Computer Science 3582 : 415-431. ScholarBank@NUS Repository.|
|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. © Springer-Verlag Berlin Heidelberg 2005.|
|Source Title:||Lecture Notes in Computer Science|
|Appears in Collections:||Staff Publications|
Show full item record
Files in This Item:
There are no files associated with this item.
checked on Oct 27, 2018
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.