References

  1. R. Alur & T. A. Henzinger (1993): Real-Time Logics: Complexity and Expressiveness. Information and Computation 104(1), pp. 35–77, doi:10.1006/inco.1993.1025.
  2. R. Alur & T. A. Henzinger (1994): A Really Temporal Logic. Journal of the ACM 41(1), pp. 181–204, doi:10.1145/174644.174651.
  3. M. Bertello, N. Gigante, A. Montanari & M. Reynolds (2016): Leviathan: A New LTL Satisfiability Checking Tool Based on a One-Pass Tree-Shaped Tableau. In: Proc. of the 25th International Joint Conference on Artificial Intelligence. IJCAI/AAAI Press, pp. 950–956.
  4. M. D'Agostino, D.M. Gabbay, R. Hähnle & J. Posegga (1999): Handbook of Tableau Methods. Springer, doi:10.1023/A:1017520120752.
  5. D. Della Monica, N. Gigante, A. Montanari, P. Sala & G. Sciavicco (2017): Bounded Timed Propositional Temporal Logic with Past Captures Timeline-based Planning with Bounded Constraints. In: Proc. of the 26th International Joint Conference on Artificial Intelligence, pp. 1008–1014, doi:10.24963/ijcai.2017/140.
  6. N. Gigante, A. Montanari & M. Reynolds (2017): A One-Pass Tree-Shaped Tableau for LTL+Past. In: Proc. of 21st International Conference on Logic for Programming, Artificial Intelligence and Reasoning, EPiC Series in Computing 46, pp. 456–473, doi:10.29007/3hb9.
  7. Y. Kesten, Z. Manna, H. McGuire & A. Pnueli (1993): A Decision Algorithm for Full Propositional Temporal Logic. In: Proc. of the 5th International Conference on Computer Aided Verification, LNCS 697. Springer, pp. 97–109, doi:10.1007/3-540-56922-7_9.
  8. O. Lichtenstein & A. Pnueli (2000): Propositional Temporal Logics: Decidability and Completeness. Logic Journal of the IGPL 8(1), pp. 55–85, doi:10.1093/jigpal/8.1.55.
  9. Z. Manna & A. Pnueli (1995): Temporal Verification of Reactive Systems - Safety. Springer, doi:10.1007/978-1-4612-4222-2.
  10. J. Christopher McCabe-Dansted & M. Reynolds (2017): A Parallel Linear Temporal Logic Tableau. In: P. Bouyer, A. Orlandini & P. San Pietro: Proceedings 8th International Symposium on Games, Automata, Logics and Formal Verification, EPTCS 256, pp. 166–179, doi:10.4204/EPTCS.256.12.
  11. M. Reynolds (2016): A New Rule for LTL Tableaux. In: Proc. of the 7th International Symposium on Games, Automata, Logics and Formal Verification, EPTCS 226, pp. 287–301, doi:10.4204/EPTCS.226.20.
  12. S. Schwendimann (1998): A New One-Pass Tableau Calculus for PLTL. In: Proc. of the 7th International Conference on Automated Reasoning with Analytic Tableaux and Related Methods, LNCS 1397. Springer, pp. 277–292, doi:10.1007/3-540-69778-0_28.

Comments and questions to: eptcs@eptcs.org
For website issues: webmaster@eptcs.org