Fair LTL synthesis for non-deterministic systems using strong cyclic planners

IJCAI International Joint Conference on Artificial Intelligence

Volumn , Issue , 2013, Pages 2343-2349

  Patrizi, Fabio ^a   Lipovetzky, Nir ^b   Geffner, Hector ^c  

^a SAPIENZA UNIVERSITY OF ROME   (Italy)

^b UNIVERSITY OF MELBOURNE   (Australia)

^c UNIVERSITAT POMPEU FABRA   (Spain)

Author keywords

[No Author keywords available]

Indexed keywords

CLASSICAL PLANNING; CONTROL SYNTHESIS; INFINITE NUMBERS; NON-DETERMINISM; NONDETERMINISTIC SYSTEMS; POTENTIAL BENEFITS; SYMBOLIC METHODS; SYNTHESIS PROBLEMS;

ARTIFICIAL INTELLIGENCE; AUTOMATA THEORY;

PLANNING;

EID: 84896061268     PISSN: 10450823     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (30)

1. A. Albarghouthi, J. Baier, and S. McIlraith. On the use of planning technology for verification. In Proc. ICAPS'09 Workshop VV&PS, 2009.
2. Rajeev Alur and Salvatore La Torre. Deterministic generators and games for LTL fragments. ACM Trans. Comput. Log., 5(1):1-25, 2004.
3. F. Bacchus and F. Kabanza. Planning for temporally extended goals. Ann. of Math. and AI, 22:5-27, 1998.
4. J.A. Baier and S.A. McIlraith. Planning with first-order temporally extended goals using heuristic search. In Proc. AAAI'06, 2006.
5. J.A. Baier, F. Bacchus, and S.A. McIlraith. A heuristic search approach to planning with temporally extended preferences. Art. Int., 173(5-6), 2009.
6. Roderick Bloem, Barbara Jobstmann, Nir Piterman, Amir Pnueli, and Yaniv Sa'ar. Synthesis of reactive(1) designs. J. Comput. Syst. Sci., 78(3):911-938, 2012.
7. Jerry R. Burch, Edmund M. Clarke, Kenneth L. McMillan, David L. Dill, and L. J. Hwang. Symbolic Model Checking: 1020 States and Beyond. Inf. Comput., 98(2):142-170, 1992.
8. Tom Bylander. The Computational Complexity of Propositional STRIPS Planning. Artif. Intell., 69(1-2):165-204, 1994.
9. Alessandro Cimatti, Marco Pistore, Marco Roveri, and Paolo Traverso. Weak, strong, and strong cyclic planning via symbolic model checking. Artif. Intell., 147(1-2):35-84, 2003.
10. S. Cresswell and A. Coddington. Compilation of LTL goal formulas into PDDL. In Proc. ECAI'04, 2004.
11. Marco Daniele, Paolo Traverso, and Moshe Y. Vardi. Strong Cyclic Planning Revisited. In ECP, pages 35-48, 1999.
12. G. De Giacomo and M. Y. Vardi. Automata-theoretic approach to planning for temporally extended goals. In Proc. ECP'99, 1999.
13. S. Edelkamp. Promela planning. In Proc. SPIN'03, 2003.
14. S. Edelkamp. On the compilation of plan constraints and preferences. In ICAPS'06, 2006.
15. Jicheng Fu, Vincent Ng, Farokh B. Bastani, and I-Ling Yen. Simple and fast strong cyclic planning for fully-observable nondeterministic planning problems. In Proc. of IJCAI, pages 1949-1954, 2011.
16. A. Gerevini and D. Long. Plan constraints and preferences in PDDL3. Technical report, Univ. of Brescia, 2005.
17. F. Kabanza and S. Thiébaux. Search control in planning for temporally extended goals. In Proc. ICAPS'05, 2005.
18. Hadas Kress-Gazit, Georgios E. Fainekos, and George J. Pappas. Where's waldo? sensorbased temporal logic motion planning. In Proc. of ICRA, pages 3116-3121, 2007.
19. Ugur Kuter, Dana S. Nau, Elnatan Reisner, and Robert P. Goldman. Using Classical Planners to Solve Nondeterministic Planning Problems. In Proc. of ICAPS, pages 190-197, 2008.
20. Andreas Morgenstern and Klaus Schneider. From LTL to Symbolically Represented Deterministic Automata. In Proc. of VMCAI, pages 279-293, 2008.
21. Andreas Morgenstern and Klaus Schneider. A LTL Fragment for GR(1)-Synthesis. In Proc. of iWIGP, pages 33-45, 2011.
22. Christian J. Muise, Sheila A. McIlraith, and J. Christopher Beck. Improved non-deterministic planning by exploiting state relevance. In Proc. of ICAPS, 2012.
23. Fabio Patrizi, Nir Lipovetzky, Giuseppe De Giacomo, and Hector Geffner. Computing infinite plans for LTL goals using a classical planner. In Proc. of IJCAI, pages 2003-2008, 2011.
24. Amir Pnueli and Roni Rosner. On the Synthesis of a Reactive Module. In Proc. of POPL, pages 179-190, 1989.
25. Amir Pnueli and Elad Shahar. A platform for combining deductive with algorithmic verification. In Proc. of CAV, pages 184-195, 1996.
26. Amir Pnueli. The Temporal Logic of Programs. In Proc. of FOCS, pages 46-57, 1977.
27. S. Richter and M. Westphal. The LAMA planner: Guiding cost-based anytime planning with landmarks. JAIR, 39:127-177, 2010.
28. W. Thomas. Automata on infinite objects. In Handbook of Theoretical Computer Science. Elsevier, 1990.
29. M. Y. Vardi and P. Wolper. Reasoning about infinite computations. Information and Computation, 115(1):1-37, 1994.
30. M. Y. Vardi. An automata-theoretic approach to linear temporal logic. In Logics for Concurrency, volume 1043 of LNCS. Springer, 1996.