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)

Volumn 4424 LNCS, Issue , 2007, Pages 485-499

  Harel, David ^a   Segall, Itai ^a  

^a WEIZMANN INSTITUTE OF SCIENCE   (Israel)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; COMPUTER PROGRAMMING LANGUAGES; MATHEMATICAL MODELS; SUPERVISORY AND EXECUTIVE PROGRAMS; FLOWCHARTING;

LIVE SEQUENCE CHARTS (LSCS); PLANNING ALGORITHM; REACTIVE SYSTEMS; SCENARIO-BASED MODELS; AI PLANNING; EXECUTION PATHS; LIVE SEQUENCE CHART; MULTI-MODAL; PLANNING ALGORITHMS; REACTIVE SYSTEM; SCENARIO-BASED; SUPERSTEP;

ARTIFICIAL INTELLIGENCE; ALGORITHMS;

EID: 37149043042     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-71209-1_37     Document Type: Conference Paper

References (32)

1. S. Barner, S. Ben-David, A. Gringauze, B. Sterin and Y. Wolfsthal, "An Algorithmic Approach to Design Exploration", Proc. International Symposium of Formal Methods Europe on Formal Methods - Getting IT Right (FME'02), 2002, pp. 146-162.
2. A. Blum and M. Fürst, "Fast Planning Through Planning Graph Analysis", Proc. 14th Intl. Joint Conf. on Artificial Intelligence (IJCAI'95), 1995, pp. 1636-1642
3. (Extended version appears in Artificial Intelligence, 90(1-2), 1997, pp. 281-300 )
4. B. Bonet and H. Geffner, "HSP: Heuristic Search Planner", Proc. 4th Intl. Conf. on Artificial Intelligence Planning Systems (AIPS'98) Planning Competition, Pittsburgh, 1998.
5. W. Damm and D. Harel, "LSCs: Breathing life into message sequence charts", Formal Methods in System Design, 19(1):45/22680, 2001.
6. Preliminary version appeared in Proc. 3rd IFIP Int. Conf. on Formal Methods for Open Object-Based Distributed Systems (FMOODS'99).
7. M. Ernst, T. Millstein and D. Weld, "Automatic SAT-Compilation of Planning Problems", Proc. 15th Intl. Joint Conf. on Artificial Intelligence (IJCAI'97), 1997, pp. 1169-1176.
8. K. Erol, D. S. Nau and V. S. Subrahmanian, "Complexity, Decidability and Undecidability Results for Domain-Independent Planning", Artificial Intelligence, 76(1-2), July 1995, pp. 75-88.
9. R. Fikes and N. Nilsson, "STRIPS: A New Approach to the Application of Theorem Proving to Problem Solving", Journal of Artificial Intelligence, 2(3/4), 1971, pp. 189-208.
10. Amos Gilboa, MSC Thesis, The Weizmann Institute of Science, 2003, "Finding all Possible Supersteps in LSCs".
11. M. Glusman, G. Kamhi, S. Mador-Haim, R. Fraer and M. Y. Vardi, "Multiple-Counterexample guided Iterative Abstraction Refinement: An Industrial Evaluation", 9th Intl. Conf. on Tools and Algorithms for the Construction and Analysis of Systems (TACAS'03), 2003, pp. 176-191.
12. D. Harel, H. Kugler, R. Marelly and A. Pnueli, "Smart Play-Out of Behavioral Requirements", Proc. 4th Int. Conf. on Formal Methods in Computer-Aided Design (FMCAD'02), November 2002, pp. 378-398.
13. D. Harel, H. Kugler and A. Pnueli, "Smart Play-Out Extended: Time and Forbidden Elements", Proc. 4th Int. Conf. on Quality Software (QSIC'04), IEEE Computer Society Press, 2004, pp. 2-10.
14. D. Harel and S. Maoz, "Assert and Negate Revisited: Modal Semantics for UML Sequence Diagrams", Proc. 5th Int. Workshop on Scenarios and State Machines: Models, Algorithms and Tools (SCESM'06), 2006, pp. 13-20.
15. D. Harel and S. Maoz, "From Multi-Modal Scenarios to Code: Compiling LSCs into Aspect J", 14th ACM SIGSOFT Symp. on Foundations of Software Engineering (FSE'14), Portland, November 2006.
16. D. Harel and R. Marelly, Come, Let's Play: Scenario-Based Programming Using LSCs and the Play-Engine, Springer-Verlag, 2003.
17. D. Harel and R. Marelly, "Specifying and Executing Behavioral Requirements: The Play-In/Play-Out Approach", Software and Systems Modeling (SoSyM) 2, 2003, pp. 82-107.
18. D. Harel and I. Segall, "Planned and Traversable Play-Out: A Flexible Method for Executing Scenario-Based Programs", Technical Report MCS07-01, The Weizmann Institute of Science, 2007.
19. J. Hoffmann and J. Koehler, "A new Method to Query and Index Sets", Proc. 16th Intl. Joint Conf. on Artificial Intelligence (IJCAI'99), 1999, pp. 462-467.
20. J. Hoffmann and B. Nebel, "The FF Planning System: Fast Plan Generation Through Heuristic Search", J. Artificial Intelligence Research, 14, 2001, pp. 253-302.
21. http://www.wisdom.weizmann.ac.il/~itais/video/TPO-Example.avi
22. IPP website, http://www.informatik.uni-freiburg.de/~koehler/ipp.html.
23. ITU-TS Recommendation Z. 120: "Message Sequence Chart (MSC)". ITU-TS, Geneva, 1996.
24. H. Kautz and B. Selman, "Pushing the Envelope: Planning, Propositional Logic, and Stochastic Search", Proc. 13th National Conf. on Artificial Intelligence (AAAI'96), Portland, 1996, pp. 1194-1201.
25. H. Kautz and B. Selman, "Blackbox: A New Approach to the Application of Theorem Proving to Problem Solving", Workshop on Planning as Combinatorial Search, Artificial Intelligence Planning Systems (AIPS'98), June 1998, pp. 58-60.
26. J. Koehler, "Planning under Resource Constraints", 13th biennial European Conf. on Artificial Intelligence (ECAI98), 1998, pp. 489-493.
27. J. Koehler, B. Nebel, J. Hoffmann and Y. Dimopoulos, "Extending Planning Graphs to an ADL Subset", Proc. 4th European Conf. on Planning (ECP'97), Springer LNAI, 1348, 1997, pp. 273-285.
28. D. Long and M. Fox, "Efficient Implementation of the Plan Graph in STAN", Journal of Artificial Intelligence Research, 10(1999), pp. 87-115.
29. E. P. D. Pednault, "ADL: Exploring the Middle Ground Between STRIPS and the Situation Calculus," Proc. 1st Intl. Conf. on Principles of Knowledge Representation and Reasoning, Toronto, 1989, pp. 324-332.
30. UML. Documentation of the unified modeling language (UML). Available from the Object Management Group (OMG), http://www.omg.org.
31. M. M. Veloso, "Nonlinear problem solving using intelligent casual-commitment", Technical Report CMU-CS-89-210, School of Computer Science, Carnegie Mellon University, 1989.
32. T. Wang, A. Roychoudhury, R.H.C. Yap and S.C. Choudhary, "Symbolic Execution of Behavioral Requirements", Proc. 6th Intl. Symp. on Practical Aspects of Declarative Languages (PADL'04), 2004, pp. 178-192.