References

  1. Rajeev Alur & David Dill (1994): A Theory of Timed Automata. Theoretical Computer Science 126(2), pp. 183–235. Available at http://dx.doi.org/10.1016/0304-3975(94)90010-8.
  2. Sebastian S. Bauer, Alexandre David, Rolf Hennicker, Kim G. Larsen, Axel Legay, Ulrik Nyman & Andrzej Wasowski (2012): Moving from Specifications to Contracts in Component-Based Design. In: Juan de Lara & Andrea Zisman: FASE, Lecture Notes in Computer Science 7212. Springer-Verlag, pp. 43–58. Available at http://dx.doi.org/10.1007/978-3-642-28872-2_3.
  3. Sebastian S. Bauer, Uli Fahrenberg, Line Juhl, Kim G. Larsen, Axel Legay & Claus R. Thrane (2011): Quantitative Refinement for Weighted Modal Transition Systems. In: Filip Murlak & Piotr Sankowski: MFCS, Lecture Notes in Computer Science 6907. Springer-Verlag, pp. 60–71. Available at http://dx.doi.org/10.1007/978-3-642-22993-0_9.
  4. Sebastian S. Bauer, Uli Fahrenberg, Axel Legay & Claus Thrane (2012): General Quantitative Specification Theories with Modalities. In: CSR, Lecture Notes in Computer Science 7353. Springer-Verlag. To appear.
  5. Sebastian S. Bauer, Line Juhl, Kim G. Larsen, Axel Legay & Jiř\'ıSrba (2012): Extending Modal Transition Systems with Structured Labels. Mathematical Structures in Computer Science. To appear.
  6. Nikola Beneš, Jan Křet\'ınský, Kim G. Larsen & Jir\'ıSrba (2009): Checking Thorough Refinement on Modal Transition Systems Is EXPTIME-Complete. In: Martin Leucker & Carroll Morgan: ICTAC, Lecture Notes in Computer Science 5684. Springer-Verlag, pp. 112–126. Available at http://dx.doi.org/10.1007/978-3-642-03466-4_7.
  7. Nathalie Bertrand, Axel Legay, Sophie Pinchinat & Jean-Baptiste Raclet (2009): A Compositional Approach on Modal Specifications for Timed Systems. In: Karin Breitman & Ana Cavalcanti: ICFEM, Lecture Notes in Computer Science 5885. Springer-Verlag, pp. 679–697. Available at http://dx.doi.org/10.1007/978-3-642-10373-5_35.
  8. Patricia Bouyer, Kim G. Larsen, Nicolas Markey, Ocan Sankur & Claus R. Thrane (2011): Timed Automata Can Always Be Made Implementable. In: Joost-Pieter Katoen & Barbara König: CONCUR, Lecture Notes in Computer Science 6901. Springer-Verlag, pp. 76–91. Available at http://dx.doi.org/10.1007/978-3-642-23217-6_6.
  9. Franck van Breugel (1996): A Theory of Metric Labelled Transition Systems. Annals of the New York Academy of Sciences 806(1), pp. 69–87. Available at http://dx.doi.org/10.1111/j.1749-6632.1996.tb49160.x.
  10. Uli Fahrenberg, Kim G. Larsen & Claus Thrane (2010): A Quantitative Characterization of Weighted Kripke Structures in Temporal Logic. Comp. Inf. 29(6+), pp. 1311–1324.
  11. Uli Fahrenberg, Axel Legay & Claus Thrane (2011): The Quantitative Linear-Time–Branching-Time Spectrum. In: Supratik Chakraborty & Amit Kumar: FSTTCS, LIPIcs 13. Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik, pp. 103–114. Available at http://dx.doi.org/10.4230/LIPIcs.FSTTCS.2011.103.
  12. Uli Fahrenberg, Axel Legay & Andrzej Wasowski (2011): Make a Difference! (Semantically). In: Jon Whittle, Tony Clark & Thomas Kühne: MoDELS, Lecture Notes in Computer Science 6981. Springer-Verlag, pp. 490–500. Available at http://dx.doi.org/10.1007/978-3-642-24485-8_36.
  13. Uli Fahrenberg, Claus R. Thrane & Kim G. Larsen (2011): Distances for Weighted Transition Systems: Games and Properties. In: Mieke Massink & Gethin Norman: QAPL, Electronic Proceedings in Theoretical Computer Science 57, pp. 134–147. Available at http://dx.doi.org/10.4204/EPTCS.57.10.
  14. Patrice Godefroid, Michael Huth & Radha Jagadeesan (2001): Abstraction-Based Model Checking Using Modal Transition Systems. In: Kim Guldstrand Larsen & Mogens Nielsen: CONCUR, Lecture Notes in Computer Science 2154. Springer-Verlag, pp. 426–440. Available at http://dx.doi.org/10.1007/3-540-44685-0_29.
  15. Alexander Gruler, Martin Leucker & Kathrin D. Scheidemann (2008): Modeling and Model Checking Software Product Lines. In: Gilles Barthe & Frank S. de Boer: FMOODS, Lecture Notes in Computer Science 5051. Springer-Verlag, pp. 113–131. Available at http://dx.doi.org/10.1007/978-3-540-68863-1_8.
  16. Orna Grumberg, Martin Lange, Martin Leucker & Sharon Shoham (2005): Don't Know in the μ-calculus. In: Radhia Cousot: VMCAI, Lecture Notes in Computer Science 3385. Springer-Verlag, pp. 233–249. Available at http://dx.doi.org/10.1007/978-3-540-30579-8_16.
  17. Vineet Gupta, Thomas A. Henzinger & Radha Jagadeesan (1997): Robust Timed Automata. In: Oded Maler: HART, Lecture Notes in Computer Science 1201. Springer-Verlag, pp. 331–345. Available at http://dx.doi.org/10.1007/BFb0014736.
  18. Thomas A. Henzinger, Rupak Majumdar & Vinayak S. Prabhu (2005): Quantifying Similarities Between Timed Systems. In: Paul Pettersson & Wang Yi: FORMATS, Lecture Notes in Computer Science 3829. Springer-Verlag, pp. 226–241. Available at http://dx.doi.org/10.1007/11603009_18.
  19. Kim G. Larsen (1989): Modal Specifications. In: Automatic Verification Methods for Finite State Systems, Lecture Notes in Computer Science 407. Springer-Verlag, pp. 232–246. Available at http://dx.doi.org/10.1007/3-540-52148-8_19.
  20. Kim G. Larsen, Uli Fahrenberg & Claus R. Thrane (2011): Metrics for weighted transition systems: Axiomatization and complexity. Theoretical Computer Science 412(28), pp. 3358–3369. Available at http://dx.doi.org/10.1016/j.tcs.2011.04.003.
  21. James R. Munkres (2000): Topology. Prentice Hall.
  22. Ulrik Nyman (2008): Modal Transition Systems as the Basis for Interface Theories and Product Lines. Aalborg University.
  23. Mathieu Sassolas, Marsha Chechik & Sebastián Uchitel (2011): Exploring inconsistencies between modal transition systems. Software and System Modeling 10(1), pp. 117–142. Available at http://dx.doi.org/10.1007/s10270-010-0148-x.
  24. Mani Swaminathan & Martin Fränzle (2007): A Symbolic Decision Procedure for Robust Safety of Timed Systems. In: TIME. IEEE Computer Society, pp. 192. Available at http://doi.ieeecomputersociety.org/10.1109/TIME.2007.39.
  25. Mani Swaminathan, Martin Fränzle & Joost-Pieter Katoen (2008): The Surprising Robustness of (Closed) Timed Automata against Clock-Drift. In: Giorgio Ausiello, Juhani Karhumäki, Giancarlo Mauri & C.-H. Luke Ong: IFIP TCS, IFIP 273. Springer-Verlag, pp. 537–553. Available at http://dx.doi.org/10.1007/978-0-387-09680-3_36.
  26. Claus Thrane, Uli Fahrenberg & Kim G. Larsen (2010): Quantitative Simulations of Weighted Transition Systems. Journal of Logic and Algebraic Programming 79(7), pp. 689–703. Available at http://dx.doi.org/10.1016/j.jlap.2010.07.010.
Comments and questions to: eptcs@eptcs.org
For website issues: webmaster@eptcs.org