References

  1. Y. Abdeddaïm, E. Asarin & O. Maler (2006): Scheduling with timed automata. Theoretical Computer Science 354(2), pp. 272–300, doi:10.1016/j.tcs.2005.11.018.
  2. R. Alur & D.L. Dill (1994): A Theory of Timed Automata. Theoretical Computer Science 126(2), pp. 183–235, doi:10.1016/0304-3975(94)90010-8.
  3. T. Amnell, E. Fersman, L. Mokrushin, P. Pettersson & W. Yi (2003): TIMES: A Tool for Schedulability Analysis and Code Generation of Real-Time Systems. In: FORMATS, pp. 60–72, doi:10.1007/978-3-540-40903-8_6.
  4. E. Asarin, O. Maler & A. Pnueli (1995): Reachability Analysis of Dynamical Systems Having Piecewise-Constant Derivatives. Theor. Comput. Sci. 138(1), pp. 35–65, doi:10.1016/0304-3975(94)00228-B.
  5. A. Basu, M. Bozga & J. Sifakis (2006): Modeling Heterogeneous Real-time Components in BIP. In: SEFM, pp. 3–12, doi:10.1109/SEFM.2006.27.
  6. R. Ben Salah (2007): On Timing Analysis of Large Systems. INP Grenoble.
  7. R. Ben Salah, M. Bozga & O. Maler (2009): Compositional Timing Analysis. In: EMSOFT, doi:10.1145/1629335.1629342. Available at http://www-verimag.imag.fr/~maler/Papers/tabst-new.pdf.
  8. A. Benveniste, P. Caspi, P. Le Guernic & N. Halbwachs (1993): Data-Flow Synchronous Languages. In: REX School/Symposium, pp. 1–45, doi:10.1007/3-540-58043-3_16.
  9. D. Beyer, C. Lewerentz & A. Noack (2003): Rabbit: A Tool for BDD-Based Verification of Real-Time Systems. In: CAV, pp. 122–125, doi:10.1007/978-3-540-45069-6_13.
  10. T. Blickle, J. Teich & L. Thiele (1998): System-Level Synthesis Using Evolutionary Algorithms. Design Autom. for Emb. Sys. 3(1), pp. 23–58, doi:10.1023/A:1008899229802.
  11. R. Bloem, K. Chatterjee, T. A. Henzinger & B. Jobstmann (2009): Better Quality in Synthesis through Quantitative Objectives. In: CAV, pp. 140–156, doi:10.1007/978-3-642-02658-4_14.
  12. P. Bouyer, U. Fahrenberg, K.G. Larsen & N. Markey (2011): Quantitative analysis of real-time systems using priced timed automata. Commun. ACM 54(9), pp. 78–87, doi:10.1145/1995376.1995396.
  13. M. Bozga, S. Graf & L. Mounier (2002): IF-2.0: A Validation Environment for Component-Based Real-Time Systems. In: CAV. Springer, pp. 343–348, doi:10.1007/3-540-45657-0_26.
  14. E. Brinksma, H. Hermanns & J.-P. Katoen (2001): Lectures on Formal Methods and Performance Analysis.
  15. G. Buttazzo (2005): Hard Real-Time Computing Systems: Predictable Schedulding Algorithms and Applications. Springer, doi:10.1007/0-387-27578-9.
  16. P. Cerný & T. A. Henzinger (2011): From Boolean to quantitative synthesis. In: EMSOFT, pp. 149–154, doi:10.1145/2038642.2038666.
  17. Edmund M. Clarke, Alexandre Donzé & Axel Legay (2010): On simulation-based probabilistic model checking of mixed-analog circuits. Formal Methods in System Design 36(2), pp. 97–113, doi:10.1007/s10703-009-0076-y.
  18. E.G. Coffman (1976): Computer and Job-shop Scheduling Theory. Wiley.
  19. A. David, K.G. Larsen, A. Legay, M. Mikucionis, D.B. Poulsen, J. van Vliet & Z. Wang (2011): Statistical Model Checking for Networks of Priced Timed Automata. In: FORMATS, pp. 80–96, doi:10.1007/978-3-642-24310-3_7.
  20. C. Daws, A. Olivero, S. Tripakis & S. Yovine (1995): The Tool KRONOS. In: Hybrid Systems, pp. 208–219.
  21. A. Degorre & O. Maler (2008): On Scheduling Policies for Streams of Structured Jobs. In: FORMATS, pp. 141–154, doi:10.1007/978-3-540-85778-5_11.
  22. S. A. Edwards & E. A. Lee (2003): The semantics and execution of a synchronous block-diagram language. Sci. Comput. Program. 48(1), pp. 21–42, doi:10.1016/S0167-6423(02)00096-5.
  23. U. Fahrenberg & S. Tripakis (2011): Formal Modeling and Analysis of Timed Systems - 9th International Conference, FORMATS. LNCS 6919. Springer, doi:10.1007/978-3-642-24310-3.
  24. M. Gries (2004): Methods for Evaluating and Covering the Design Space during Early Design Development. Integration, the VLSI Journal 38(2), pp. 131–183, doi:10.1016/S0167-9260(04)00032-X.
  25. T. A. Henzinger, P. W. Kopke, A. Puri & P. Varaiya (1998): What's Decidable about Hybrid Automata?. J. Comput. Syst. Sci. 57(1), pp. 94–124, doi:10.1006/jcss.1998.1581.
  26. J.-F. Kempf, M. Bozga & O. Maler (2011): Performance Evaluation of Schedulers in a Probabilistic Setting. In: Fahrenberg & Tripakis, pp. 1–17, doi:10.1007/978-3-642-24310-3_1.
  27. Y. Kesten, A. Pnueli, J. Sifakis & S. Yovine (1992): Integration Graphs: A Class of Decidable Hybrid Systems. In: Hybrid Systems, pp. 179–208, doi:10.1007/3-540-57318-6_29.
  28. H. Kopetz (2011): Real-Time Systems: Design Principles for Distributed Embedded Applications. Springer, doi:10.1007/978-1-4419-8237-7.
  29. K.G. Larsen, G. Behrmann, E. Brinksma, A. Fehnker, T. Hune, P. Pettersson & J. Romijn (2001): As Cheap as Possible: Efficient Cost-Optimal Reachability for Priced Timed Automata. In: CAV, doi:10.1007/3-540-44585-4_47.
  30. K.G Larsen, P. Pettersson & W. Yi (1997): UPPAAL in a nutshell. International Journal on Software Tools for Technology Transfer (STTT) 1(1), pp. 134–152, doi:10.1007/s100090050010.
  31. C.L. Liu & J. Layland (1973): Scheduling Algorithms for Multiprogramming in a Hard-Real-Time Environment. In: Readings in Hardware/Software Co-Design, pp. 179– 194, doi:10.1016/b978-155860702-6/50016-8.
  32. J. W. S. Liu (2000): Real-Time Systems. Prentice-Hall.
  33. O. Maler (2011): On Under-Determined Dynamical Systems. In: EMSOFT, pp. 89–96, doi:10.1145/2038642.2038658.
  34. M. Massink & G. Norman (2011): Proceedings Ninth Workshop on Quantitative Aspects of Programming Languages. EPTCS 57, doi:10.4204/EPTCS.57.
  35. C. Palamidessi & A. Riska (2011): Eighth International Conference on Quantitative Evaluation of Systems, QEST 2011, doi:10.1109/QEST.2011.1.
  36. A. D. Pimentel, C. Erbas & S. Polstra (2006): A Systematic Approach to Exploring Embedded System Architectures at Multiple Abstraction Levels. IEEE Trans. Computers 55(2), pp. 99–112, doi:10.1109/TC.2006.16.
  37. STMicroelectonics & CEA (2010): Platform 2012: A Many-core programmable accelerator for Ultra-Efficient Embedded Computing in Nanometer Technology. Technical Report. Available at http://www.2parma.eu/images/stories/p2012_whitepaper.pdf.
  38. S. Stuijk, M. Geilen & T. Basten (2006): SDF^\voidb@x 3: SDF For Free. In: ACSD, pp. 276–278, doi:10.1109/ACSD.2006.23.
  39. W. Thies, M. Karczmarek & S. P. Amarasinghe (2002): StreamIt: A Language for Streaming Applications. In: CC, pp. 179–196, doi:10.1007/3-540-45937-5_14.
  40. F. Wang (2004): Efficient verification of timed automata with BDD-like data structures. STTT 6(1), pp. 77–97, doi:10.1007/s10009-003-0135-4.
  41. H. L. S. Younes & R. G. Simmons (2002): Probabilistic Verification of Discrete Event Systems Using Acceptance Sampling. In: CAV, pp. 223–235, doi:10.1007/3-540-45657-0_17.
  42. S. Yovine (1997): KRONOS: A Verification Tool for Real-Time Systems. STTT 1(1-2), pp. 123–133, doi:10.1007/s100090050009.
Comments and questions to: eptcs@eptcs.org
For website issues: webmaster@eptcs.org