TY - GEN
T1 - On the power of play-out for scenario-based programs
AU - Harel, David
AU - Kantor, Amir
AU - Maoz, Shahar
N1 - Funding Information:
The research was supported in part by The John von Neumann Minerva Center for the Development of Reactive Systems at the Weizmann Institute of Science and by a Grant from the G.I.F., the German-Israeli Foundation for Scientific Research and Development.
PY - 2010
Y1 - 2010
N2 - We investigate the power of play-out, the execution mechanism associated with scenario-based programming, which was defined as the operational semantics of live sequence charts (LSC). We compare some of the play-out strategies and mechanisms suggested in the literature, and discuss their strengths and limitations. Specifically, we define a simple infinite hierarchy of LSC programs, and use it to show that smart play-out, the lookahead version of play-out guided by model-checking, is strictly weaker than full synthesis from LSC.
AB - We investigate the power of play-out, the execution mechanism associated with scenario-based programming, which was defined as the operational semantics of live sequence charts (LSC). We compare some of the play-out strategies and mechanisms suggested in the literature, and discuss their strengths and limitations. Specifically, we define a simple infinite hierarchy of LSC programs, and use it to show that smart play-out, the lookahead version of play-out guided by model-checking, is strictly weaker than full synthesis from LSC.
UR - http://www.scopus.com/inward/record.url?scp=77950130397&partnerID=8YFLogxK
U2 - 10.1007/978-3-642-11512-7_13
DO - 10.1007/978-3-642-11512-7_13
M3 - פרסום בספר כנס
AN - SCOPUS:77950130397
SN - 364211511X
SN - 9783642115110
T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
SP - 207
EP - 220
BT - Concurrency, Compositionality, and Correctness - Essays in Honor of Willem-Paul de Roever
A2 - Dams, Dennis
A2 - Hannemann, Ulrich
A2 - Steffen, Martin
ER -