Conference ProceedingsOPEN ACCESS

Planned and traversable play-out: A flexible method for executing scenario-based programs

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (2007) 4424 LNCS 485-499
DOI: 10.1007/978-3-540-71209-1_37
22Citations
Citations of this article
10Readers
Mendeley users who have this article in their library.

This article is free to access.

Abstract

We introduce a novel approach to the smart execution of scenario-based models of reactive systems, such as those resulting from the multi-modal inter-object language of live sequence charts (LSCs). Our approach finds multiple execution paths from a given state of the system, and allows the user to interactively traverse them. The method is based on translating the problem of finding a superstep of execution into a problem in the AI planning domain, and issuing a known planning algorithm, which we have had to modify and strengthen for our purposes. © Springer-Verlag Berlin Heidelberg 2007.

Cite

CITATION STYLE

APA

Harel, D., & Segall, I. (2007). Planned and traversable play-out: A flexible method for executing scenario-based programs. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 4424 LNCS, pp. 485–499). Springer Verlag. https://doi.org/10.1007/978-3-540-71209-1_37

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free