Communicating sequential processes
Communicating sequential processes
Specification and proof in real-time CSP
Specification and proof in real-time CSP
Automatic synthesis of state machines from trace diagrams
Software—Practice & Experience
Inference of message sequence charts
Proceedings of the 22nd international conference on Software engineering
LSCs: Breathing Life into Message Sequence Charts
Formal Methods in System Design
System Design with SystemC
The Theory and Practice of Concurrency
The Theory and Practice of Concurrency
Multiple instances and symbolic variables in executable sequence charts
OOPSLA '02 Proceedings of the 17th ACM SIGPLAN conference on Object-oriented programming, systems, languages, and applications
An Automata Based Interpretation of Live Sequence Charts
TACAS 2001 Proceedings of the 7th International Conference on Tools and Algorithms for the Construction and Analysis of Systems
Model Checking of Message Sequence Charts
CONCUR '99 Proceedings of the 10th International Conference on Concurrency Theory
An Improved Failures Model for Communicating Processes
Seminar on Concurrency, Carnegie-Mellon University
Synthesizing State-Based Object Systems from LSC Specifications
CIAA '00 Revised Papers from the 5th International Conference on Implementation and Application of Automata
Timed CSP: Theory and Practice
Proceedings of the Real-Time: Theory in Practice, REX Workshop
Come, Let's Play: Scenario-Based Programming Using LSC's and the Play-Engine
Come, Let's Play: Scenario-Based Programming Using LSC's and the Play-Engine
A Formal Semantics of UML Sequence Diagram
ASWEC '04 Proceedings of the 2004 Australian Software Engineering Conference
Model Checking Live Sequence Charts
ICECCS '05 Proceedings of the 10th IEEE International Conference on Engineering of Complex Computer Systems
Synthesis of Open Reactive Systems from Scenario-Based Specifications
Fundamenta Informaticae - Application of Concurrency to System Design (ACSD'03)
Distributed reactive systems are hard to synthesize
SFCS '90 Proceedings of the 31st Annual Symposium on Foundations of Computer Science
From Live Sequence Charts to State Machines and Back: A Guided Tour
IEEE Transactions on Software Engineering
Design Synthesis from Interaction and State-Based Specifications
IEEE Transactions on Software Engineering
Lazy buffer semantics for partial order scenarios
Automated Software Engineering
Compositional Synthesis of Reactive Systems from Live Sequence Chart Specifications
TACAS '09 Proceedings of the 15th International Conference on Tools and Algorithms for the Construction and Analysis of Systems: Held as Part of the Joint European Conferences on Theory and Practice of Software, ETAPS 2009,
Controller Synthesis from LSC Requirements
FASE '09 Proceedings of the 12th International Conference on Fundamental Approaches to Software Engineering: Held as Part of the Joint European Conferences on Theory and Practice of Software, ETAPS 2009
Scenario-based and value-based specification mining: better together
Proceedings of the IEEE/ACM international conference on Automated software engineering
Scenario-based analysis and synthesis of real-time systems using UPPAAL
Proceedings of the Conference on Design, Automation and Test in Europe
Synthesis from scenario-based specifications
Journal of Computer and System Sciences
On the power of play-out for scenario-based programs
Concurrency, Compositionality, and Correctness
| Hi-index | 0.00 |
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.