2005
DOI: 10.1109/tse.2005.137
|View full text |Cite
|
Sign up to set email alerts
|

From live sequence charts to state machines and back: a guided tour

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
2
1

Citation Types

0
23
0

Year Published

2006
2006
2015
2015

Publication Types

Select...
6
1
1

Relationship

0
8

Authors

Journals

citations
Cited by 44 publications
(23 citation statements)
references
References 39 publications
0
23
0
Order By: Relevance
“…In fact, in later developments of LSCs (e.g. [4], [33]) the prechart for existential LSCs is dropped.…”
Section: Discussion and Related Workmentioning
confidence: 99%
See 2 more Smart Citations
“…In fact, in later developments of LSCs (e.g. [4], [33]) the prechart for existential LSCs is dropped.…”
Section: Discussion and Related Workmentioning
confidence: 99%
“…[3], [4], [1], [2], [5]) have noted the limitations of the core scenario notation described above. One key issue is the limited expressiveness of a single sequence chart.…”
Section: Live Sequence Charts -Elsc and Ulscmentioning
confidence: 99%
See 1 more Smart Citation
“…This line of work was continued in [10], which includes an implementation of a sound but not complete algorithm for Statechart synthesis. A game theoretic approach to synthesis from LSCs involving a reduction to parity games is described in [3]. Synthesis from LSCs using a reduction to CSP appears in [27].…”
Section: Related Workmentioning
confidence: 99%
“…These works include algorithms to generate statechart models from MSCs [19], formalization and undecidability results for the synthesis for a simple variant of live sequence charts (LSCs) [9], and Harel's play-in, play-out approach for LSCs [11,12]. Another approach is proposed by Alur et al in [2,3].…”
Section: Introductionmentioning
confidence: 99%