Superposition as a Decision Procedure for Timed Automata

Mathematics in Computer Science

Volumn 6, Issue 4, 2012, Pages 409-425

  Fietzke, Arnaud ^a,b   Weidenbach, Christoph ^a,b  

^a MAX PLANCK INSTITUTE FOR INFORMATICS   (Germany)

^b SAARLAND UNIVERSITY   (Germany)

Author keywords

Decision procedures; Hierarchic theorem proving; Superposition; Timed automata

Indexed keywords

EID: 84873268528     PISSN: 16618270     EISSN: 16618289     Source Type: Journal    
DOI: 10.1007/s11786-012-0134-5     Document Type: Article

References (55)

1. Althaus, E., Kruglov, E., Weidenbach, C.: Superposition modulo linear arithmetic SUP(LA). In: FroCos, LNCS, vol. 5749, pp. 84-99. Springer (2009).
2. Alur, R., Courcoubetis, C., Dill, D.: Model-checking for real-time systems. In: Logic in Computer Science, 1990. LICS '90, Proceedings., Fifth Annual IEEE Symposium on e, pp. 414-425, June 1990.
3. Alur R., Courcoubetis C., Dill D.: Model-checking in dense real-time. Inf. Comput. 104, 2-34 (1993).
4. Alur R., Dill D. L.: A theory of timed automata. Theor. Comput. Sci. 126(2), 183-235 (1994).
5. Armando A., Bonacina M. P., Ranise S., Schulz S.: New results on rewrite-based satisfiability procedures. ACM Trans. Comput. Log. 10(1), 4: 1-4: 51 (2009).
6. Armando, A., Ranise, S., Rusinowitch, M.: Uniform derivation of decision procedures by superposition. In: Fribourg, L. (ed.) Computer Science Logic. Lecture Notes in Computer Science, vol. 2142, pp. 513-527. Springer, Berlin (2001).
7. Audemard, G., Cimatti, A., Kornilowicz, A., Sebastiani, R.: Bounded model checking for timed systems. In: Peled, D., Vardi, M. (eds.) Formal Techniques for Networked and Distributed Sytems-FORTE 2002. Lecture Notes in Computer Science, vol. 2529, pp. 243-259. Springer, Berlin (2002).
8. Bachmair, L., Ganzinger, H.: Resolution theorem proving. In: Robinson, J. A., Voronkov, A. (eds.) Handbook of Automated Reasoning, vol. 1, Chap. 2. Elsevier and MIT Press, pp. 19-99 (2001).
9. Bachmair, L., Ganzinger, H., Waldmann, U.: Superposition with simplification as a decision procedure for the monadic class with equality. In: Gottlob, G., Leitsch, A., Mundici, D. (eds.) Computational Logic and Proof Theory. Lecture Notes in Computer Science, vol. 713, pp. 83-96. Springer, Berlin (1993).
10. Bachmair L., Ganzinger H., Waldmann U.: Refutational theorem proving for hierarchic first-order theories. Appl. Algebra Eng. Commun. Comput. 5, 193-212 (1994).
11. Baumgartner, P., Fuchs, A., Tinelli, C.: LIA-model evolution with linear integer arithmetic constraints. In: Cervesato, I., Veith, H., Voronkov, A. (eds.) Logic for Programming, Artificial Intelligence, and Reasoning, Proceedings of the 15th International Conference, LPAR 2008, Doha, Qatar, November 22-27, 2008. LNCS, vol. 5330, pp. 258-273. Springer (2008).
12. Baumgartner, P., Tinelli, C.: The model evolution calculus with equality. In: Nieuwenhuis, R. (eds.) Automated Deduction-CADE-20, Proceedings of the 20th International Conference on Automated Deduction, Tallinn, Estonia, July 22-27, 2005. Lecture Notes in Computer Science, vol. 3632, pp. 392-408. Springer (2005).
13. Behrmann, G., David, A., Larsen, K. G.: A tutorial on uppaal. In: Bernardo, M., Corradini, F. (eds.) Formal Methods for the Design of Real-Time Systems: 4th International School on Formal Methods for the Design of Computer, Communication, and Software Systems, SFM-RT 2004. LNCS, vol. 3185, pp. 200-236. Springer-Verlag, September 2004.
14. Bengtsson, J., Yi, W.: Timed automata: Semantics, algorithms and tools. In: Lectures on Concurrency and Petri Nets, pp. 87-124 (2003).
15. Bernays P., Schönfinkel M.: Zum Entscheidungsproblem der mathematischen Logik. Mathematische Annalen 99, 342-372 (1928).
16. Bonacina, M. P., Lynch, Ch., de Moura L. M.: On deciding satisfiability by DPLL(Γ+ T) and unsound theorem proving. In: Schmidt, R. A. (eds.) Automated Deduction-CADE-22, Proceedings of the 22nd International Conference on Automated Deduction, Montreal, Canada, August 2-7, 2009. LNCS, vol. 5663, pp. 35-50. Springer (2009).
17. Bouyer, P., Laroussinie, F., Reynier, P.-A.: Diagonal constraints in timed automata: forward analysis of timed systems. In: FORMATS, pp. 112-126 (2005).
18. Daws, C., Tripakis, S.: Model checking of real-time reachability properties using abstractions. In: Proceedings of the 4th International Conference on Tools and Algorithms for Construction and Analysis of Systems, pp. 313-329, London, UK. Springer-Verlag (1998).
19. de Moura, L., Rue H., Sorea, M.: Lazy theorem proving for bounded model checking over infinite domains. In: Voronkov, A. (eds.) Automated Deduction-CADE-18. Lecture Notes in Computer Science, vol. 2392, pp. 438-455. Springer, Berlin (2002).
20. de Moura, L. M., Bjørner, N.: Engineering DPLL(T) + saturation. In: Armando, A., Baumgartner, P., Dowek, G. (eds.) Automated Reasoning, 4th International Joint Conference, IJCAR 2008. LNCS, vol. 5195, pp. 475-490. Springer (2008).
21. Fermüller, C. G., Leitsch, A., Hustadt, U., Tamet, T.: Resolution decision procedures. In: Robinson, A., Voronkov, A.: Handbook of Automated Reasoning, vol.~II, Chap.~25. Elsevier, pp. 1791-1849 (2001).
22. Fietzke, A., Hermanns, H., Weidenbach, C.: Superposition-based analysis of first-order probabilistic timed automata. In: Fermüller, C., Voronkov, A. (eds.) 17th International Conference on Logic for Programming, Artificial Intelligence and Reasoning, LPAR 2010. LNCS, vol. 6397, pp. 302-316. Springer (2010).
23. Fietzke, A., Kruglov, E., Weidenbach, C.: Automatic generation of invariants for circular derivations in SUP(LA). In: Bjørner, N., Voronkov, A. (eds.) Logic for Programming, Artificial Intelligence, and Reasoning. Lecture Notes in Computer Science, vol. 7180, pp. 197-211. Springer, Berlin (2012).
24. Fribourg, L.: A closed-form evaluation for extended timed automata. Technical Report, CNRS and Ecole Normale Supérieure de Cachan (1998).
25. Fribourg, L.: Constraint logic programming applied to model checking. In: Bossi, A. (eds.) Logic-Based Program Synthesis and Transformation. Lecture Notes in Computer Science, vol. 1817, pp. 30-41. Springer, Berlin (2000).
26. Ganzinger, H., de Nivelle, H.: A superposition decision procedure for the guarded fragment with equality. In: Proceedings of the 14th Symposium on Logic in Computer Science, pp. 295-303 (1999).
27. Ganzinger, H., Korovin, K.: New directions in instatiation-based theorem proving. In: Abramsky, S. (ed.) 18th Annual IEEE Symposium on Logic in Computer Science, LICS'03. IEEE Computer Society, pp. 55-64 (2003).
28. Ghilardi, S., Ranise, S.: Backward reachability of array-based systems by SMT solving: termination and invariant synthesis. Log. Methods Comput. Sci. 6(4), 1-48 (2010).
29. 1complete. J. Symb. Log. 56(2), 637-642 (1991).
30. Henzinger T. A., Nicollin X., Sifakis J., Yovine S.: Symbolic model checking for real-time systems. Inf. Comput. 111(2), 193-244 (1994).
31. Hillenbrand, T., Weidenbach, C.: Superposition for finite domains. Research Report MPI-I-2007-RG1-002, Max-Planck Institute for Informatics, Saarbrücken, Germany, April 2007.
32. Horbach M., Weidenbach C.: Superposition for fixed domains. ACM Trans. Comput. Log. 11(4), 1-35 (2010).
33. Jacquemard, F., Meyer, C., Weidenbach, C.: Unification in extensions of shallow equational theories. In: Nipkow, T. (ed.) Rewriting Techniques and Applications, 9th International Conference, RTA-98. LNCS, vol. 1379, pp. 76-90. Springer (1998).
34. Korovin, K., Voronkov, A.: Integrating linear arithmetic into superposition calculus. In: Duparc, J., Henzinger, T. A. (eds.) Computer Science Logic. LNCS, vol. 4646, pp. 223-237. Springer (2007).
35. Kroening, D., Strichman, O.: Decision Procedures: An Algorithmic Point of View. Texts in Theoretical Computer Science. Springer, Berlin (2008).
36. Larsen, K. G., Pettersson, P., Yi, W.: Model-checking for real-time systems. In: Reichel, H. (eds.) Fundamentals of Computation Theory. Lecture Notes in Computer Science, vol. 965, pp. 62-88. Springer, Berlin (1995).
37. Larsen K. G., Pettersson P., Yi W.: UPPAAL in a nutshell. Int. J. Softw. Tools Technol. Transf. 1, 134-152 (1997).
38. Minsky, M. L.: Computation: Finite and Infinite Machines. Automatic Computation. Prentice-Hall, Englewood Cliffs (1967).
39. Nieuwenhuis, R.: Basic paramodulation and decidable theories (extended abstract). In: Proceedings 11th IEEE Symposium on Logic in Computer Science, LICS'96, pp. 473-482. IEEE Computer Society Press (1996).
40. Nieuwenhuis R., Oliveras A., Tinelli C.: Solving SAT and SAT modulo theories: from an abstract Davis-Putnam-Logemann-Loveland procedure to DPLL(T). J. ACM 53, 937-977 (2006).
41. Nieuwenhuis, R., Rubio, A.: Paramodulation-based theorem proving. In: Robinson, A., Voronkov, A. (eds.) Handbook of Automated Reasoning, vol. I. Elsevier, pp. 371-443 (2001).
42. Nonnengart, A.: Hybrid systems verification by location elimination. In: Lynch, N. A., Krogh, B. H. (eds.) Hybrid Systems: Computation and Control, Proceedings of the Third International Workshop, HSCC 2000, Pittsburgh, PA, USA, March 23-25, 2000. Lecture Notes in Computer Science, vol. 1790, pp. 352-365. Springer (2000).
43. Pearson, J., Weise, C., Yi, W., Behrmann, G., Behrmann, G., Larsen, K. G.: Efficient timed reachability analysis using clock difference diagrams. In: Proceedings of the 12th International Conference on Computer Aided Veri, pp. 341-353. Springer-Verlag (1998).
44. Presburger, M.: Über die Vollständigkeit eines gewissen Systems der Arithmetik ganzer Zahlen, in welchen die Addition als einzige Operation hervortritt. In: Sprawozdanie z I Kongresu Matematyków Krajów Słowiańskich, pp. 92-101 (1930).
45. Rümmer, P.: A constraint sequent calculus for first-order logic with linear integer arithmetic. In: Cervesato, I., Veith, H., Voronkov, A. (eds.) Logic for Programming, Artificial Intelligence, and Reasoning, Proceedings of the 15th International Conference, LPAR 2008, Doha, Qatar, November 22-27, 2008. Lecture Notes in Computer Science, vol. 5330, pp. 274-289. Springer (2008).
46. Sorea M.: Bounded model checking for timed automata. Electr. Notes Theor. Comput. Sci. 68(5), 116-134 (2003).
47. Suda, M., Weidenbach, C., Wischnewski, P.: On the saturation of YAGO. In: Automated Reasoning, 5th International Joint Conference, IJCAR 2010. LNAI, pp. 441-456, vol. 6173, Edinburgh, UK. Springer (2010).
48. Tarski, A.: A decision method for elementary algebra and geometry. Technical Report R-109, The RAND Corporation, 1951. Submitted August 1, 1948.
49. Tripakis, S.: L'Analyse Formelle des Systèmes Temporisés en Pratique. PhD thesis, Université Joseph Fourier-Grenoble 1, 1998.
50. Tripakis, S.: Verifying progress in timed systems. In: Katoen, J.-P. (eds.) Formal Methods for Real-Time and Probabilistic Systems. Lecture Notes in Computer Science, vol. 1601, pp. 299-314. Springer, Berlin (1999).
51. Urbina, L.: Analysis of hybrid systems in CLP(R). In: Freuder, E. (eds.) Principles and Practice of Constraint Programming-CP96. Lecture Notes in Computer Science, vol. 1118, pp. 451-467. Springer, Berlin (1996).
52. Wachter, B., Zhang, L., Hermanns, H.: Probabilistic model checking modulo theories. In: Fourth International Conference on the Quantitative Evaluation of Systems, 2007. QEST 2007, pp. 129-140 (2007).
53. Waldmann, U.: Superposition and chaining for totally ordered divisible abelian groups (Extended abstract). In: Goré, R., Leitsch, A., Nipkow, T. (eds.) Automated reasoning: First International Joint Conference, IJCAR 2001. LNAI, vol. 2083, pp. 226-241, Siena, Italy, 2001. Springer.
54. Wang F.: Efficient verification of timed automata with BDD-like data structures. STTT 6(1), 77-97 (2004).
55. Sergio, Y.: (1997) Kronos: A verification tool for real-time systems. (Kronos user's manual release 2. 2). Int. J. Softw. Tools Technol. Transf. 1: 123-133.