References

  1. Luca Aceto, Antonis Achilleos, Adrian Francalanza, Anna Ingólfsdóttir & Karoliina Lehtinen (2019): Adventures in monitorability: from branching to linear time and back again. Proceedings of the ACM on Programming Languages 3(POPL), pp. 1–29, doi:10.1145/3290365.
  2. Rayhana Amjad, Rob van Glabbeek & Liam O'Connor (2024): Definitive Set Semantics for LTL3. Archive of Formal Proofs. https://isa-afp.org/entries/LTL3_Semantics.html, Formal proof development.
  3. Bowen Alpern & Fred B. Schneider (1985): Defining liveness. Information Processing Letters 21(4), pp. 181–185, doi:10.1016/0020-0190(85)90056-0.
  4. Andreas Bauer & Yliès Falcone (2012): Decentralised LTL Monitoring. In: FM 2012: Formal Methods. Springer, pp. 85–100, doi:10.1007/978-3-642-32759-9_10.
  5. Fahiem Bacchus & Froduald Kabanza (1996): Using Temporal Logic to Control Search in a Forward Chaining Planner, pp. 141–153. IOS Press.
  6. Stephen Blamey (2002): Partial Logic. In: Handbook of Philosophical Logic. Springer, pp. 261–353, doi:10.1007/978-94-017-0458-8_5.
  7. Andreas Bauer, Martin Leucker & Christian Schallhart (2007): The Good, the Bad, and the Ugly, But How Ugly Is Ugly?. In: Runtime Verification. Springer, pp. 126–138, doi:10.1007/978-3-540-77395-5_11.
  8. Andreas Bauer, Martin Leucker & Christian Schallhart (2010): Comparing LTL Semantics for Runtime Verification. Journal of Logic and Computation 20(3), pp. 651–674, doi:10.1093/logcom/exn075.
  9. Andreas Bauer, Martin Leucker & Christian Schallhart (2011): Runtime Verification for LTL and TLTL. ACM Transactions on Software Engineering Methodology 20(4), doi:10.1145/2000799.2000800.
  10. Edward Chang, Zohar Manna & Amir Pnueli (1993): The Safety-Progress Classification. In: Logic and Algebra of Specification. Springer, pp. 143–202, doi:10.1007/978-3-642-58041-3_5.
  11. Ming Chai & Bernd-Holger Schlingloff (2014): Online Monitoring of Distributed Systems with a Five-Valued LTL. In: IEEE 44th International Symposium on Multiple-Valued Logic, pp. 226–231, doi:10.1109/ISMVL.2014.47.
  12. Cindy Eisner, Dana Fisman, John Havlicek, Yoad Lustig, Anthony McIsaac & David Van Campenhout (2003): Reasoning with Temporal Logic on Truncated Paths. In: Computer Aided Verification. Springer, pp. 27–39, doi:10.1007/978-3-540-45069-6_3.
  13. Thomas A. Henzinger, Nicolas Mazzocchi & N. Ege Saraç (2023): Quantitative Safety and Liveness. In: Foundations of Software Science and Computation Structures. Springer, pp. 349–370, doi:10.1007/978-3-031-30829-1_17.
  14. Froduald Kabanza & Sylvie Thiébaux (2005): Search Control in Planning for Temporally Extended Goals. In: International Conference on Automated Planning and Scheduling. AAAI, pp. 130–139.
  15. Orna Kupferman & Moshe Y. Vardi (2001): Model Checking of Safety Properties. Formal Methods in System Design 19(3), pp. 291–314, doi:10.1023/A:1011254632723.
  16. Leslie Lamport (1977): Proving the correctness of multiprocess programs. IEEE Transactions on Software Engineering 3(2), pp. 125–143, doi:10.1109/TSE.1977.229904.
  17. Orna Lichtenstein, Amir Pnueli & Lenore Zuck (1985): The Glory of the Past. In: Logics of Programs. Springer, pp. 196–218, doi:10.1007/3-540-15648-8_16.
  18. Zohar Manna & Amir Pnueli (1992): The Temporal Logic of Reactive and Concurrent Systems. Springer, doi:10.1007/978-1-4612-0931-7.
  19. Zohar Manna & Amir Pnueli (1995): Temporal Verification of Reactive Systems: Safety. Springer, doi:10.1007/978-1-4612-4222-2.
  20. Liam O'Connor & Oskar Wickström (2022): Quickstrom: Property-based Acceptance Testing with LTL Specifications. In: Programming Language Design and Implementation, PLDI 2022. ACM, pp. 1025–1038, doi:10.1145/3519939.3523728.
  21. Grigore Roşu & Klaus Havelund (2005): Rewriting-Based Techniques for Runtime Verification. Automated Software Engineering 12(2), pp. 151–197, doi:10.1007/s10515-005-6205-y.
  22. Paulo Tabuada & Daniel Neider (2016): Robust Linear Temporal Logic. In: 25th EACSL Annual Conference on Computer Science Logic, CSL 2016, Leibniz International Proceedings in Informatics (LIPIcs) 62. Schloss Dagstuhl – Leibniz-Zentrum für Informatik, pp. 10:1–10:21, doi:10.4230/LIPIcs.CSL.2016.10.

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