Reasoning on LTL on finite traces: Insensitivity to infiniteness

Proceedings of the National Conference on Artificial Intelligence

Volumn 2, Issue , 2014, Pages 1027-1033

  De Giacomo, Giuseppe ^a   De Masellis, Riccardo ^a   Montali, Marco ^b  

^a SAPIENZA UNIVERSITY OF ROME   (Italy)

^b FREE UNIVERSITY OF BOZEN BOLZANO   (Italy)

Author keywords

[No Author keywords available]

Indexed keywords

FINITE TRACES;

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

References (28)

1. Bacchus, F., and Kabanza, F. 2000. Using temporal logics to express search control knowledge for planning. Artif. Intell. 116(1-2):123-191.
2. Baier, J. A., and Mcllraith, S. A. 2006. Planning with first- order temporally extended goals using heuristic search. In Proc. of the 21th AAAI Conf. on Artificial Intelligence (AAAI), 788-795.
3. Baier, C.; Katocn, J.-P.; and Guldstrand Larsen, K. 2008. Principles of Model Checking. The MIT Press.
4. Bauer, A., and Haslum, P. 2010. LTL goal specifications revisited. In Proc. of the 19th Eu. Conf. on Artificial Intelligence (ECAI), 881-886. IOS Press.
5. Bauer, A.; Leucker, M.; and Schallhart, C. 2007. The good, the bad, and the ugly, but how ugly is ugly? In Proc. of the 7th Int. Ws. on Runtime Verification (RV), 126-138.
6. Calvanese, D.; De Giacomo, G.; and Vardi, M. Y. 2002. Reasoning about actions and planning in LTL action theories. In Proc. of the 8th Int. Conf. on the Principles of Knowledge Representation and Reasoning (KR5) 93-602. Morgan Kaufmann.
7. De Giacomo, G., and Vardi, M. Y. 2013. Linear temporal logic and linear dynamic logic on finite traces. In Proc. of the 23rd Int. Joint Conf. on Artificial Intelligence (IJCAI). UCAI/AAAI.
8. Dwyer, M. B.; Avrunin, G. S.; and Corbett, J. C. 1999. Patterns in property specifications for finite-state verification. In Proc. of the 1999 Int. Conf. on Software Engineering (ICSE), 411-420. ACM Press.
9. Edelkamp, S. 2006. On the compilation of plan constraints and preferences. In Proc. of the 16th Int. Conf. on Automated Planning and Scheduling (ICAPS), 374-377. AAAI.
10. Gabbay, D.; Pnueli, A.; Shelah, S.; and Stavi, J. 1980. On the temporal analysis of fairness. In Proc. of the 7th ACM SIGPLAN-SIGACT Symp. on Principles of Programming Languages (POLP), 163-173.
11. Gerevini, A.; Haslum, P.; Long, D.; Saetti, A.; and Dimopou- los, Y. 2009. Deterministic planning in the fifth international planning competition: Pddl3 and experimental evaluation of the planners. Artificial Intelligence 173(5-6):619-668.
12. Gerth, R.; Peled, D.; Vardi, M. Y.; and Wolper, P. 1995. Simple on-the-fly automatic verification of linear temporal logic. In Proc. of the 15th IFIP Int. Symp. on Protocol Specification, Testing and Verification (PSTV), 3-18. IFDP.
13. Giannakopoulou, D., and Havelund, K. 2001. Automata- based verification of temporal properties on running programs. In Proc. of the 16th IEEE Int. Conf. on Automated Software Engineering (ASE), 412-416. IEEE Computer Society.
14. Holzmann, G. J. 1995. Tutorial: Proving properties of concurrent system with spin. In Proc. of the 6th Int. Conf. on Concurrency Theory (CONCUR), LNCS, 453-455. Springer.
15. Lichtenstein, O.; Pnueli, A.; and Zuck, L. D. 1985. The glory of the past. In Logic of Programs, 196-218.
16. McDermott, D.; Ghallab, M.; Howe, A.; Knoblock, C.; Ram, A.; Veloso, M.; Weld, D.; and Wilkins, D. 1998. Pddl - The planning domain definition language - version 1.2. Technical report, TR-98-003, Yale Center for Computational Vision and Contro.
17. Montali, M.; Pesic, M.; van der Aalst, W. M. P.; Chesani, F.; Mello, P.; and Storari, S. 2010. Declarative specification and verification of service choreographies. ACM Transactions on the Web 4(1).
18. Montali, M. 2010. Specification and Verification of Declarative Open Interaction Models: A Logic-Based Approach, volume 56 of LNBIP. Springer.
19. Pesic, M., and van der Aalst, W. M. P. 2006. A declarative approach for flexible business processes management. In Proc. of the BPM 2006 Workshops, LNCS, 169-180. Springer.
20. Pesic, M.; Schonenberg, H.; and van der Aalst, W. M. P. 2007. Declare: Full support for loosely-structured processes. In Proc. of the 11th IEEE Int. Enterprise Distributed Object Computing Conf. (EDOC) 287-300. IEEE Computer Society.
21. Pesic, M. 2008. Constraint-Based Workflow Management Systems: Shifting Controls to Users. Ph.D. Dissertation, Beta Research School for Operations Management and Logistics, Eindhoven.
22. Pnueli, A. 1977. The temporal logic of programs. In Proc. of the 18th Ann. Symp. on Foundations of Computer Science (FOCS), 46-57. IEEE Computer Society.
23. Reiter, R. 2001. Knowledge in Action: Logical Foundations for Specifying and Implementing Dynamical Systems. The MIT Press.
24. Rozier, K. Y., and Vardi, M. Y. 2007. LTL satisfiability checking. In Proc. of SPIN - Model Checking Software, LNCS, 149-167. Springer.
25. Sun, Y.; Xu, W.; and Su, J. 2012. Declarative choreographies for artifacts. In Proc. of the 10th Int. Conf. on Service- Oriented Computing (ICSOC), LNCS, 420-434. Springer.
26. van der Aalst, W. M. P., and Pesic, M. 2006. Decser flow: Towards a truly declarative service flow language. In Proc. of the 3rd Ws. on Web Services and Formal Methods (WS- FM2006), LNCS, 1-23. Springer.
27. Vardi, M. Y. 1996. An automata-theoretic approach to linear temporal logic. In Logics for Concurrency: Structure versus Automata, LNCS. Springer. 238-266.
28. Westergaard, M. 2011. Better algorithms for analyzing and enacting declarative workflow languages using LTL. In Proc. of the 9th Int. Conf on Business Process Management (BPM), LNCS, 83-98. Springer.