Embedded Software Analysis with MOTOR

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 3185, Issue , 2004, Pages 268-293

  Katoen, Joost Pieter ^a,b   Bohnenkamp, Henrik ^a,b   Klaren, Rie ^a,b   Hermanns, Holger ^a,b  

^a UNIVERSITY OF TWENTE   (Netherlands)

^b SAARLAND UNIVERSITY   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

FIRMWARE; MODELING LANGUAGES; QUALITY OF SERVICE; REAL TIME SYSTEMS; STOCHASTIC SYSTEMS; TIME SHARING SYSTEMS;

DESCRIPTION LANGUAGES; MODEL AND ANALYSIS; NON-FUNCTIONAL; PAPER SURVEYS; PLUG-AND-PLAY NETWORKS; REACTIVE SYSTEM; SOFT REAL TIME; TIMED SYSTEMS;

QUALITY CONTROL;

EID: 33745466576     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-30080-9_9     Document Type: Article

References (41)

1. R. Alur and D.L. Dill. A theory of timed automata. Th. Comp. Sc., 126(2):183235, 1994.
2. T. Amnell, G. Behrmann, J. Bengtsson, P.R. D'Argenio, A. David, A. Fehnker, T. Hune, B. Jeannet, K.G. Larsen, M.O. Möller, P. Pettersson, C. Weise, W. Yi. UPPAAL - Now, next, and future. In: Modeling and Verification of Parallel Processes, LNCS 2067:99-124, 2000.
3. C. Baier, F. Ciezinski and M. Groesser. PROBMELA: a modeling language for communicating probabilistic processes. In: Int. Conf. on Formal Methods and Models for Codesign, ACM Press, 2004.
4. A. Belinfante, J. Feenstra, R.G. de Vries, J. Tretmans, N. Goga, L. Feijs, S. Mauw and L. Heerink. Formal test automation: a simple experiment. In: Int. Workshop on Testing of Communicating Systems XII, pp. 179 - 196, Kluwer, 1999.
5. M. Ben-Ari. Principles of Concurrent and Distributed Programming. Prentice Hall, 1990.
6. G. Berry. Preemption and concurrency. In: R.K. Shyamasundar, ed, Found, of Software Techn. and Th. Comp. Sc., LNCS 761: 72-93, 1993.
7. M. Bodlaender, J. Guidi and L. Heerink. Enhancing discovery with liveness. In: IEEE Consumer Comm. and Networking Conf., IEEE CS Press, 2004.
8. H. Bohnenkamp, T. Courtney, D. Daly, S. Derisavi, H. Hermanns, J.-P. Katoen, V. Lam and W.H. Sanders. On integrating the Möbius and MoDeST modeling tools. Dependable Systems and Networks, pp. 671-672, 2003, IEEE CS Press.
9. H. Bohnenkamp, P.R. D'Argenio, H. Hermanns, J.-P. Katoen and J. Klaren. MODEST: A compositional modeling formalism for real-time and stochastic systems. 2004 (in preparation).
10. H. Bohnenkamp, J. Gorter, J. Guidi and J.-P. Katoen. A simple and fair protocol to detect node absence in dynamic distributed systems. 2004 (in preparation).
11. H. Bohnenkamp, H. Hermanns, J.-P. Katoen and J. Klaren. The MODEST modelling tool and its implementation. In: Modelling Techniques and Tools for Comp. Perf. Ev., LNCS 2794, 2003.
12. H. Bohnenkamp, H. Hermanns, J. Klaren, A. Mader and Y.S. Usenko. Synthesis and stochastic assessment of schedules for lacquer production. In: Quantitative Evaluation of Systems, IEEE CS Press, 2004 (to appear).
13. S. Bornot and J. Sifakis. An algebraic framework for urgency. Inf. and Comp., 163:172-202, 2001.
14. Special issue on embedded systems. IEEE Computer, 33(9), 2000.
15. M. Bravetti and Gorrieri. The theory of interactive generalized semi-Markov processes. Th. Comp. Sc., 282(1): 5-32, 2002.
16. P.R. D'Argenio, H. Hermanns, J.-P. Katoen and J. Klaren. MODEST: A modelling language for stochastic timed systems. In: Proc. Alg. and Prob. Methods, LNCS 2165: 87-104, 2001.
17. P.R. D'Argenio, J.-P. Katoen, T.C. Ruys and G. Tretmans. The bounded retransmission protocol must be on time! In Tools and Algorithms for the Construction and Analysis of Systems, LNCS 1217: 416-431, 1997.
18. D. Deavours, G. Clark, T. Courtney, D. Daly, S. Derasavi, J. Doyle, W.H. Sanders and P. Webster. The MÖBIUS framework and its implementation. IEEE Tr. on Softw. Eng., 28(10):956-970, 2002.
19. J.-C. Fernandez, H. Garavel, L. Mounier, A. Rasse, C. Rodriguez, and J. Sifakis. A tool box for the verification of LOTOS programs. In 14th IEEE Int. Conf. on Softw. Eng., 1992.
20. E. Gafni and M. Mitzenmacher. Analysis of timing-based mutual exclusion with random times. SIAM J. Comput., 31(3): 816-837, 2001.
21. H. Garavel and M. Sighireanu. On the introduction of exceptions in E-LOTOS. In: Formal Description Techniques IX, pp. 469-484. Kluwer, 1996.
22. P.W. Glynn. A GSMP formalism for discrete event systems. Proc. of the IEEE, 77(1): 14-23, 1989.
23. J. Gorter. Modeling and analysis of the liveness UPnP extension. Master's thesis, Univ. of Twente, 2004.
24. H. Hermanns. Interactive Markov Chains - the Quest for Quantified Quality. LNCS 2428, 2002.
25. H. Hermanns, J.-P. Katoen, J. Meyer-Kayser and M. Siegle. A tool for model checking Markov chains. J. on Software. Tools for Technology Transfer, 4(2):153172, 2003.
26. J. Hillston. A Compositional Approach to Performance Modelling. Cambr. Univ. Press, 1996.
27. C. Hoare. Communicating Sequential Processes. Prentice-Hall, 1985.
28. G.J. Holzmann. The SPIN Model Checker. Addison-Wesley, 2002.
29. D.N. Jansen, H. Hermanns and Y.S. Usenko. Prom StoCharts to MODEST: a comparative reliability analysis of train radio communications. 2004 (submitted).
30. M. Jelasity, W. Kowalczyk and M. van Steen. Newscast computing. Tech. Rep. IR-CS-006, Vrije Univ. Amsterdam, 2003.
31. M. Kwiatkowska, G. Norman, R. Segala, and J. Sproston. Automatic verification of real-time systems with discrete probability distributions. Th. Comp. Sc., 282:101150, 2002.
32. E.A. Lee. Embedded software. In: M. Zelkowitz, editor, Advances in Computers, vol. 56, Academic Press, 2002.
33. J.F. Meyer, A. Movaghar and W.H. Sanders. Stochastic activity networks: structure, behavior and application. In: Int. Workshop on Timed Petri Nets, pp. 106115, 1985.
34. G.D. Plotkin. A structural approach to operational semantics. DAIMI FN-19, Aarhus University, 1981.
35. M.L. Puterman. Markov Decision Processes: Discrete Stochastic Dynamic Programming. John Wiley & Sons, 1994.
36. M. Raynal and F. Tronel. Group membership failure detection: a simple protocol and its probabilistic analysis. Distrib. Syst. Engng, 6: 95-102, 1999.
37. R. van Renesse, Y. Minsky and M. Hayden. A gossip-style failure detection service In: IFIP Conf. on Distributed Systems, Platforms, and Open Distributed Processing, pp. 55-70, 1998.
38. W.-P. de Roever, F.S. de Boer, U. Hannemann, J. Hooman, Y. Lakhnech, M. Poel, and J. Zwiers. Concurrency Verification: Introduction to Compositional and Noncompositional Methods. Cambridge Univ. Press, 2001.
39. W.H. Sanders and J.F. Meyer. Stochastic activity networks: formal definitions and concepts. In: Formal Methods for Performance Evaluation, LNCS 2090: 315-344, 2001.
40. F.B. Schneider, B. Bloom and K. Marzullo. Putting time into proof outlines. In: REX Workshop on Real-Time:Theory in Practice, LNCS 600: 618-639, 1991.
41. R. Segala and N.A. Lynch. Probabilistic simulations for probabilistic processes. Nordic J. of Computing, 2(2): 250-273, 1995.