1. R. Alur & D. L. Dill (1994): A Theory of Timed Automata. Theor. Comput. Sci. 126(2), pp. 183–235, doi:10.1016/0304-3975(94)90010-8.
  2. R. Alur, T. Feder & T. A. Henzinger (1996): The Benefits of Relaxing Punctuality. Journal of ACM 43(1), pp. 116–146, doi:10.1145/227595.227602.
  3. F. Bacchus & F. Kabanza (1998): Planning for temporally extended goals. Annals of Mathematics and Artificial Intelligence 22(1–2), pp. 5–27, doi:10.1023/A:1018985923441.
  4. H. Barringer, Y. Falcone, B. Finkbeiner, K. Havelund, I. Lee, G.J. Pace, G. Rosu, O. Sokolsky & N. Tillmann (2010): Preface. In: Proc. of RV 2010, the First International Conference on Runtime Verification, St. Julians, Malta, November 1-4, 2010, Lecture Notes in Computer Science 6418. Springer, doi:10.1007/978-3-642-16612-9.
  5. H. Barringer, D. Rydeheard & K. Havelund (2010): Rule Systems for Run-Time monitoring: From Eagle to RuleR. Journal of Logic and Computation 20(3), pp. 675–706, doi:10.1093/logcom/exn076.
  6. E. Bartocci, R. Grosu, A. Karmarkar, S. A. Smolka, S. D. Stoller, E. Zadok & J. Seyster (2012): Adaptive Runtime Verification. In: Proc. of RV 2012, the third International Conference on Runtime Verification, September, 2012 Istanbul, Turkey, Lecture Notes in Computer Science 7687. Springer, pp. 168–182, doi:10.1007/978-3-642-35632-2_18.
  7. A. Bauer & Y. Falcone (2012): Decentralised LTL monitoring. In: FM 2012: Formal Methods 7436. Springer Berlin Heidelberg, pp. 85–100, doi:10.1007/978-3-642-32759-9_10.
  8. A. Bauer, M. Leucker & C. Schallhart (2006): Monitoring of real-time properties. In: Proc. of FSTTCS, the 26th Conference on Foundations of Software Technology and Theoretical Computer Science, Lecture Notes in Computer Science 4337. Springer-Verlag, Berlin, Heidelberg, doi:10.1007/11813040_37.
  9. A. Bauer, M. Leucker & C. Schallhart (2010): Comparing LTL semantics for runtime verification. Journal of Logic and Computation 20(3), pp. 651–674, doi:10.1093/logcom/exn075.
  10. A. Bauer, M. Leucker & C. Schallhart (2011): Runtime verification for LTL and TLTL. ACM Transactions on Software Engineering and Methodology 20(4), doi:10.1145/2000799.2000800.
  11. G. Behrmann, A. David, K. G. Larsen, J. Håkansson, P. Pettersson, W. Yi & M. Hendriks (2006): UPPAAL 4.0. In: Proc. of QEST 2006, the Third International Conference on the Quantitative Evaluation of Systems, Riverside, California, USA. IEEE Computer Society, pp. 125–126, doi:10.1109/QEST.2006.59.
  12. B. Bonakdarpour, S. Navabpour & S. Fischmeister (2011): Sampling-Based Runtime Verification. In: Proc. FM 2011: Formal Methods, the 17th International Symposium on Formal Methods, Limerick, Ireland, June 20-24, 2011, Lecture Notes in Computer Science 6664. Springer, pp. 88–102, doi:10.1007/978-3-642-21437-0_9.
  13. J. R. Büchi (1990): On a decision method in restricted second order arithmetic. In: The Collected Works of J. Richard Büchi. Springer New York, pp. 425–435, doi:10.1007/978-1-4613-8928-6_23.
  14. S. Callanan, D. J. Dean, M. Gorbovitski, R. Grosu, J. Seyster, S. A. Smolka, S. D. Stoller & E. Zadok (2008): Software monitoring with bounded overhead. In: Proc. of IPDPS 2008, the 22nd IEEE International Symposium on Parallel and Distributed Processing, Miami, Florida USA, April 14-18, 2008. IEEE, pp. 1–8, doi:10.1109/IPDPS.2008.4536433.
  15. F. Cassez (2012): The Complexity of Codiagnosability for Discrete Event and Timed Systems. IEEE Transactions on Automatic Control 57(7), pp. 1752–1764, doi:10.1109/TAC.2012.2183169.
  16. E. M. Clarke & E. Emerson (1982): Design and Synthesis of Synchronization Skeletons Using Branching Time Temporal Logic. In: Dexter Kozen: Logics of Programs, Lecture Notes in Computer Science 131. Springer Berlin / Heidelberg, pp. 52–71, doi:10.1007/BFb0025774.
  17. M. d'Amorim & G. Rosu (2005): Efficient Monitoring of ω-Languages. In: Proc. of CAV 2005, the 17th International Conference on Computer Aided Verification, Edinburgh, Scotland, UK, July 6-10, 2005, Lecture Notes in Computer Science 3576. Springer, pp. 364–378, doi:10.1007/11513988_36.
  18. M. B. Dwyer, G. S. Avrunin & J. C. Corbett (1999): Patterns in property specifications for finite-state verification. In: Proc. of ICSE '99, the 21st international conference on Software engineering, Los Angeles, California, USA. ACM, pp. 411–420, doi:10.1145/302405.302672.
  19. K. Etessami & G. J. Holzmann (2000): Optimizing Büchi Automata. In: Proc. of CONCUR 2000 - Concurrency Theory, the 11th International Conference University Park, PA, USA, August 2225, 2000, Lecture Notes in Computer Science 1877. Springer, pp. 153–168, doi:10.1007/3-540-44618-4_13.
  20. P Gastin & D. Oddoux (2003): LTL with Past and Two-Way Very-Weak Alternating Automata. In: Proc. of MFCS 2003, the 28th International Symposium in Mathematical Foundations of Computer Science,Bratislava, Slovakia, August 25-29, 2003, Lecture Notes in Computer Science 2747. Springer, pp. 439–448, doi:10.1007/978-3-540-45138-9_38.
  21. M. Geilen (2001): On the Construction of Monitors for Temporal Logic Properties. Electr. Notes Theor. Comput. Sci. 55(2), pp. 181–199, doi:10.1016/S1571-0661(04)00252-X.
  22. A. Genon, T. Massart & C. Meuter (2006): Monitoring Distributed Controllers: When an efficient LTL algorithm on Sequences Is Needed to Model-Check Traces. In: Proc. of FM 2006: Formal Methods, the 14th International Symposium on Formal Methods, Hamilton, Canada, August 21-27, 2006, Lecture Notes in Computer Science 4085, pp. 557–572, doi:10.1007/11813040_37.
  23. M. Gunzert & A. Naegele (1999): Component-based development and verification of safety critical software for a brake-by-wire system with synchronous software components. PDSE '99, pp. 134–145, doi:10.1109/PDSE.1999.779745.
  24. K. Havelund & G. Rosu (2002): Runtime Verification, RV 2002: Preface. Electr. Notes Theor. Comput. Sci. 70(4), pp. 201–202, doi:10.1016/S1571-0661(05)80585-7.
  25. K. Kalajdzic, E. Bartocci, S. A. Smolka, Scott Stoller & G. Grosu (2013): Runtime Verification with Particle Filtering. In: Proc. of RV 2013, the fourth International Conference on Runtime Verification, INRIA Rennes, France, 24-27 September, 2013, Lecture Notes in Computer Science. Springer, pp. To Appear.
  26. H. Kopetz, M. Holzmann & W. Elmenreich (2001): A universal smart transducer interface: TTP/A. Comput. Syst. Sci. Eng. 16(2), pp. 71–77, doi:10.1109/ISORC.2000.839507.
  27. L. Lamport (1978): Time, Clocks and the Ordering of Events in a Distributed System. Communications of the ACM 21(7), pp. 558–565, doi:10.1145/359545.359563.
  28. O. Lichtenstein, A. Pnueli & L. Zuck (1985): The glory of the past. Lecture Notes in Computer Science 193, pp. 196–218, doi:10.1007/3-540-15648-8_16.
  29. M. Lukasiewycz, M. Glaß, J. Teich & P. Milbredt (2009): FlexRay schedule optimization of the static segment. In: Proc. of the CODES+ISSS '09, the 7th IEEE/ACM international conference on Hardware/software codesign and system synthesis, Grenoble, France. ACM, pp. 363–372, doi:10.1145/1629435.1629485.
  30. N. Markey (2003): Temporal logic with past is exponentially more succinct. EATCS Bulletin 79, pp. 122–128.
  31. S.P. Miller, M.W. Whalen & D.D. Cofer (2010): Software model checking takes off. Communications of the ACM 53(2), pp. 58–64, doi:10.1145/1646353.1646372.
  32. A. Pnueli (1977): The temporal logic of programs. Proc. 18th IEEE Symposium on Foundations of Computer Science, pp. 46–57, doi:10.1109/SFCS.1977.32.
  33. T. Pop, P. Pop, P. Eles, Z. Peng & A. Andrei (2008): Timing analysis of the FlexRay communication protocol. Real-Time Systems 39(1–3), pp. 205–235, doi:10.1109/ECRTS.2006.31.
  34. J.P. Queille & J. Sifakis (1982): Specification and verification of concurrent systems in CESAR. In: Proc. of the 5th Colloquium on International Symposium on Programming. Springer-Verlag, pp. 337–351, doi:10.1007/3-540-11494-7_22.
  35. G. Rosu & K. Havelund (2005): Rewriting-Based Techniques for Runtime Verification. Automated Software Engineering 12(2), pp. 151–197, doi:10.1007/s10515-005-6205-y.
  36. K. Sen, A. Vardhan, G. Agha & G. Rosu (2006): Decentralized runtime analysis of multithreaded applications, doi:10.1109/IPDPS.2006.1639591.
  37. K. Sen, A. Vardhan, G. Agha & G. Roşu (2004): Efficient decentralized monitoring of safety in distributed systems 26, pp. 418–427, doi:10.1109/ICSE.2004.1317464.
  38. S. D. Stoller, E. Bartocci, J. Seyster, R. Grosu, K. Havelund, S. A. Smolka & E. Zadok (2011): Runtime Verification with State Estimation. In: Proc. of RV 2011, the Second international conference on Runtime verification, San Francisco, CA, USA, Lecture Notes in Computer Science 7186. Springer-Verlag, pp. 193–207, doi:10.1007/978-3-642-29860-8_15.
  39. S. Tripakis (2005): Decentralized observation problems, pp. 6–11, doi:10.1109/CDC.2005.1582122.
  40. Y. Wang, T. Yoo & S. Lafortune (2007): Diagnosis of Discrete Event Systems Using Decentralized Architectures. Discrete Event Dynamic Systems 17(2), pp. 233–263, doi:10.1007/s10626-006-0006-8.
  41. Y. Wang, T.-S. Yoo & S. Lafortune (2007): Diagnosis of Discrete Event Systems Using Decentralized Architectures. Discrete Event Dynamic Systems: Theory and Applications 17(2), pp. 233–263, doi:10.1007/s10626-006-0006-8.
  42. P. Wolper (2001): Constructing Automata from Temporal Logic Formulas: A Tutorial. In: Lectures on formal methods and performance analysis, Lecture Notes in Computer Science 2090. Springer-Verlag New York, Inc., pp. 261–277, doi:10.1007/3-540-44667-2_7.

Comments and questions to:
For website issues: