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

Authors:
David Harel;Itai Segall
Affiliations:
The Weizmann Institute of Science, Rehovot, Israel;The Weizmann Institute of Science, Rehovot, Israel
Venue:
TACAS'07 Proceedings of the 13th international conference on Tools and algorithms for the construction and analysis of systems
Year:
2007

Citing 17
Cited 13

ADL: exploring the middle ground between STRIPS and the situation calculus

Proceedings of the first international conference on Principles of knowledge representation and reasoning
Complexity, decidability and undecidability results for domain-independent planning

Artificial Intelligence - Special volume on planning and scheduling
LSCs: Breathing Life into Message Sequence Charts

Formal Methods in System Design
Smart Play-out of Behavioral Requirements

FMCAD '02 Proceedings of the 4th International Conference on Formal Methods in Computer-Aided Design
An Algorithmic Approach to Design Exploration

FME '02 Proceedings of the International Symposium of Formal Methods Europe on Formal Methods - Getting IT Right
Extending Planning Graphs to an ADL Subset

ECP '97 Proceedings of the 4th European Conference on Planning: Recent Advances in AI Planning
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
Smart Play-Out Extended: Time and Forbidden Elements

QSIC '04 Proceedings of the Quality Software, Fourth International Conference
Assert and negate revisited: modal semantics for UML sequence diagrams

Proceedings of the 2006 international workshop on Scenarios and state machines: models, algorithms, and tools
From multi-modal scenarios to code: compiling LSCs into aspectJ

Proceedings of the 14th ACM SIGSOFT international symposium on Foundations of software engineering
Automatic SAT-compilation of planning problems

IJCAI'97 Proceedings of the Fifteenth international joint conference on Artifical intelligence - Volume 2
The FF planning system: fast plan generation through heuristic search

Journal of Artificial Intelligence Research
Efficient implementation of the plan graph in STAN

Journal of Artificial Intelligence Research
A new method to index and query sets

IJCAI'99 Proceedings of the 16th international joint conference on Artifical intelligence - Volume 1
Fast planning through planning graph analysis

IJCAI'95 Proceedings of the 14th international joint conference on Artificial intelligence - Volume 2
Multiple-counterexample guided iterative abstraction refinement: an industrial evaluation

TACAS'03 Proceedings of the 9th international conference on Tools and algorithms for the construction and analysis of systems
Pushing the envelope: planning, propositional logic, and stochastic search

AAAI'96 Proceedings of the thirteenth national conference on Artificial intelligence - Volume 2

Generating Executable Scenarios from Natural Language

CICLing '09 Proceedings of the 10th International Conference on Computational Linguistics and Intelligent Text Processing
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,
Accelerating Smart Play-Out

SOFSEM '10 Proceedings of the 36th Conference on Current Trends in Theory and Practice of Computer Science
Some results on the expressive power and complexity of LSCs

Pillars of computer science
PlayGo: towards a comprehensive tool for scenario based programming

Proceedings of the IEEE/ACM international conference on Automated software engineering
Programming coordinated behavior in java

ECOOP'10 Proceedings of the 24th European conference on Object-oriented programming
A Compiler for Multimodal Scenarios: Transforming LSCs into AspectJ

ACM Transactions on Software Engineering and Methodology (TOSEM)
Model-checking behavioral programs

EMSOFT '11 Proceedings of the ninth ACM international conference on Embedded software
Behavioral programming, decentralized control, and multiple time scales

Proceedings of the compilation of the co-located workshops on DSM'11, TMC'11, AGERE!'11, AOOPES'11, NEAT'11, & VMIL'11
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
Behavioral programming

Communications of the ACM
A decentralized approach for programming interactive applications with JavaScript and blockly

Proceedings of the 2nd edition on Programming systems, languages and applications based on actors, agents, and decentralized control abstractions

Quantified Score

Hi-index	0.02

Visualization

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.