References

  1. S. Akshay, Timos Antonopoulos, Joël Ouaknine & James Worrell (2015): Reachability problems for Markov chains. Inf. Process. Lett. 115(2), pp. 155–158, doi:10.1016/j.ipl.2014.08.013.
  2. Christel Baier, Joost-Pieter Katoen, Holger Hermanns & Verena Wolf (2005): Comparative branching-time semantics for Markov chains. Inf. Comput. 200(2), pp. 149–214, doi:10.1016/j.ic.2005.03.001.
  3. Patrick Billingsley (1995): Probability And Measure, 3rd edition. Wiley-Interscience.
  4. Franck Cassez, René Rydhof Hansen & Mads Chr. Olesen (2012): What is a Timing Anomaly?. In: Tullio Vardanega: 12th International Workshop on Worst-Case Execution Time Analysis, WCET 2012, July 10, 2012, Pisa, Italy, OASICS 23. Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik, pp. 1–12, doi:10.4230/OASIcs.WCET.2012.1.
  5. Edmund M. Clarke, David E. Long & Kenneth L. McMillan (1989): Compositional Model Checking. In: Proceedings of the Fourth Annual Symposium on Logic in Computer Science (LICS '89), Pacific Grove, California, USA, June 5-8, 1989. IEEE Computer Society, pp. 353–362, doi:10.1109/LICS.1989.39190.
  6. Flavio Corradini, Roberto Gorrieri & Marco Roccetti (1995): Performance Preorder: Ordering Processes with Respect to Speed. In: JiríWiedermann & Petr Hájek: Mathematical Foundations of Computer Science 1995, 20th International Symposium, MFCS'95, Prague, Czech Republic, August 28 - September 1, 1995, Proceedings, Lecture Notes in Computer Science 969. Springer, pp. 444–453, doi:10.1007/3-540-60246-1_150.
  7. Marc Geilen, Stavros Tripakis & Maarten Wiggers (2011): The earlier the better: a theory of timed actor interfaces. In: Marco Caccamo, Emilio Frazzoli & Radu Grosu: Proceedings of the 14th ACM International Conference on Hybrid Systems: Computation and Control, HSCC 2011, Chicago, IL, USA, April 12-14, 2011. ACM, pp. 23–32, doi:10.1145/1967701.1967707.
  8. Norbert Götz, Ulrich Herzog & Michael Rettelbach (1993): Multiprocessor and Distributed System Design: The Integration of Functional Specification and Performance Analysis Using Stochastic Process Algebras. In: Lorenzo Donatiello & Randolph D. Nelson: Performance Evaluation of Computer and Communication Systems, Joint Tutorial Papers of Performance '93 and Sigmetrics '93, Santa Clara, CA, USA, May 10-14, 1993, Lecture Notes in Computer Science 729. Springer, pp. 121–146, doi:10.1007/BFb0013851.
  9. Ronald L. Graham (1969): Bounds on Multiprocessing Timing Anomalies. SIAM Journal of Applied Mathematics 17(2), pp. 416–429, doi:10.1137/0117039.
  10. Holger Hermanns, Ulrich Herzog & Vassilis Mertsiotakis (1998): Stochastic Process Algebras - Between LOTOS and Markov Chains. Computer Networks 30(9-10), pp. 901–924, doi:10.1016/S0169-7552(97)00133-5.
  11. Jane Hillston (1996): A compositional approach to performance modelling. Distinguished Dissertations in Computer Science. Cambridge University Press, doi:10.1017/CBO9780511569951.
  12. Raimund Kirner, Albrecht Kadlec & Peter P. Puschner (2009): Precise Worst-Case Execution Time Analysis for Processors with Timing Anomalies. In: 21st Euromicro Conference on Real-Time Systems, ECRTS 2009, Dublin, Ireland, July 1-3, 2009. IEEE Computer Society, pp. 119–128, doi:10.1109/ECRTS.2009.8.
  13. Edward A. Lee (2008): Cyber Physical Systems: Design Challenges. In: 11th IEEE International Symposium on Object-Oriented Real-Time Distributed Computing (ISORC 2008), 5-7 May 2008, Orlando, Florida, USA. IEEE Computer Society, pp. 363–369, doi:10.1109/ISORC.2008.25.
  14. Thomas Lundqvist & Per Stenström (1999): Timing Anomalies in Dynamically Scheduled Microprocessors. In: Proceedings of the 20th IEEE Real-Time Systems Symposium, Phoenix, AZ, USA, December 1-3, 1999. IEEE Computer Society, pp. 12–21, doi:10.1109/REAL.1999.818824.
  15. Gerald Lüttgen & Walter Vogler (2001): A Faster-than Relation for Asynchronous Processes. In: Kim Guldstrand Larsen & Mogens Nielsen: CONCUR 2001 - Concurrency Theory, 12th International Conference, Aalborg, Denmark, August 20-25, 2001, Proceedings, Lecture Notes in Computer Science 2154. Springer, pp. 262–276, doi:10.1007/3-540-44685-0_18.
  16. Gerald Lüttgen & Walter Vogler (2006): Bisimulation on speed: A unified approach. Theor. Comput. Sci. 360(1-3), pp. 209–227, doi:10.1016/j.tcs.2006.03.004.
  17. Sneana Maovi, Saa Stoi & Rade Hajdin (2015): Application of Semi-Markov Decision Process in Bridge Management. IABSE Symposium Report 105(28), pp. 1–8, doi:10.2749/222137815818358204.
  18. Faron Moller & Chris M. N. Tofts (1991): Relating Processes With Respect to Speed. In: Jos C. M. Baeten & Jan Friso Groote: CONCUR '91, 2nd International Conference on Concurrency Theory, Amsterdam, The Netherlands, August 26-29, 1991, Proceedings, Lecture Notes in Computer Science 527. Springer, pp. 424–438, doi:10.1007/3-540-54430-5_104.
  19. Martin R. Neuhäußer & Joost-Pieter Katoen (2007): Bisimulation and Logical Preservation for Continuous-Time Markov Decision Processes. In: Luís Caires & Vasco Thudichum Vasconcelos: CONCUR 2007 - Concurrency Theory, 18th International Conference, CONCUR 2007, Lisbon, Portugal, September 3-8, 2007, Proceedings, Lecture Notes in Computer Science 4703. Springer, pp. 412–427, doi:10.1007/978-3-540-74407-8_28.
  20. Joël Ouaknine & James Worrell (2014): Positivity Problems for Low-Order Linear Recurrence Sequences. In: Chandra Chekuri: Proceedings of the Twenty-Fifth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2014, Portland, Oregon, USA, January 5-7, 2014. SIAM, pp. 366–379, doi:10.1137/1.9781611973402.27.
  21. Mathias Ruggaard Pedersen, Nathanaël Fijalkow, Giorgio Bacci, Kim G. Larsen & Radu Mardare (2018): Timed Comparisons of Semi-Markov Processes. In: Shmuel Tomi Klein, Carlos Martín-Vide & Dana Shapira: Language and Automata Theory and Applications - 12th International Conference, LATA 2018, Ramat Gan, Israel, April 9-11, 2018, Proceedings, Lecture Notes in Computer Science 10792. Springer, pp. 271–283, doi:10.1007/978-3-319-77313-1_21.
  22. Muhammad Reza Pulungan (2009): Reduction of Acyclic Phase-Type Representations. Faculty of Natural Sciences and Technology, Saarland University, doi:10.22028/D291-25951.
  23. Jan Reineke, Björn Wachter, Stephan Thesing, Reinhard Wilhelm, Ilia Polian, Jochen Eisinger & Bernd Becker (2006): A Definition and Classification of Timing Anomalies. In: WCET, OASICS 4. Internationales Begegnungs- und Forschungszentrum fuer Informatik (IBFI), Schloss Dagstuhl, Germany, doi:10.4230/OASIcs.WCET.2006.671.
  24. Ichiro Satoh & Mario Tokoro (1994): A Formalism for Remotely Interacting Processes. In: Takayasu Ito & Akinori Yonezawa: Theory and Practice of Parallel Programming, International Workshop TPPP'94, Sendai, Japan, November 7-9, 1994, Proceedings, Lecture Notes in Computer Science 907. Springer, pp. 216–228, doi:10.1007/BFb0026571.
  25. Ana Sokolova & Erik P. de Vink (2004): Probabilistic Automata: System Types, Parallel Composition and Comparison. In: Christel Baier, Boudewijn R. Haverkort, Holger Hermanns, Joost-Pieter Katoen & Markus Siegle: Validation of Stochastic Systems - A Guide to Current Research, Lecture Notes in Computer Science 2925. Springer, pp. 1–43, doi:10.1007/978-3-540-24611-4_1.
  26. Terence Tao (2013): An Introduction to Measure Theory. Graduate studies in mathematics. American Mathematical Society.
  27. O. S. Thomas & J. O. Sobanjo (2016): Semi-Markov Decision Process: A Decision Tool for Transportation Infrastructure Management Systems. In: International Conference on Transportation and Development, pp. 384–396, doi:10.1061/9780784479926.036.
  28. Walter Vogler (1995): Timed Testing of Concurrent Systems. Inf. Comput. 121(2), pp. 149–171, doi:10.1006/inco.1995.1130.
  29. Walter Vogler (2003): Faster asynchronous systems. Inf. Comput. 184(2), pp. 311–342, doi:10.1016/S0890-5401(03)00065-8.
Comments and questions to: eptcs@eptcs.org
For website issues: webmaster@eptcs.org