On the power of play-out for scenario-based programs

David Harel*, Amir Kantor, Shahar Maoz

*Corresponding author for this work

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

Abstract

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.

Original languageEnglish
Title of host publicationConcurrency, Compositionality, and Correctness - Essays in Honor of Willem-Paul de Roever
EditorsDennis Dams, Ulrich Hannemann, Martin Steffen
Pages207-220
Number of pages14
DOIs
StatePublished - 2010
Externally publishedYes

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume5930 LNCS
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Fingerprint

Dive into the research topics of 'On the power of play-out for scenario-based programs'. Together they form a unique fingerprint.

Cite this