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

作者: David Harel , Itai Segall

DOI: 10.1007/978-3-540-71209-1_37

关键词: TraverseModel checkingComputer scienceDomain (software engineering)Distributed computingSequence diagramState (computer science)Message sequence chartReactive systemAutomated planning and scheduling

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

参考文章(31)
Edwin P. D. Pednault, ADL: exploring the middle ground between STRIPS and the situation calculus principles of knowledge representation and reasoning. pp. 324- 332 ,(1989)
H. Kugler, A. Pnueli, D. Hard, Smart play-out extended: time and forbidden elements international conference on quality software. pp. 2- 10 ,(2004) , 10.1109/QSIC.2004.31
Jana Koehler, Bernhard Nebel, Jörg Hoffmann, Yannis Dimopoulos, Extending Planning Graphs to an ADL Subset Lecture Notes in Computer Science. pp. 273- 285 ,(1997) , 10.1007/3-540-63912-8_92
Jorg Hoffmann, Jana Koehler, A new Method to Index and Query Sets international joint conference on artificial intelligence. pp. 462- 467 ,(1999)
David Harel, Hillel Kugler, Rami Marelly, Amir Pnueli, Smart Play-out of Behavioral Requirements formal methods in computer-aided design. ,vol. 2517, pp. 378- 398 ,(2002) , 10.1007/3-540-36126-X_23
Tao Wang, Abhik Roychoudhury, Roland H. C. Yap, S. C. Choudhary, Symbolic Execution of Behavioral Requirements Practical Aspects of Declarative Languages. pp. 178- 192 ,(2004) , 10.1007/978-3-540-24836-1_13
J. Hoffmann, B. Nebel, The FF planning system: fast plan generation through heuristic search Journal of Artificial Intelligence Research. ,vol. 14, pp. 253- 302 ,(2001) , 10.1613/JAIR.855
H. Kautz, Bart Selman, BLACKBOX : A New approach to the application of theorem proving to problem solving AIPS98 Workshop on Planning as Combinatorial Search. pp. 58- 60 ,(1998)