Extending UPPAAL for the modeling and verification of dynamic real-time systems

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

Volumn 8161 LNCS, Issue , 2013, Pages 111-132

  Boudjadar, Abdeldjalil ^a   Vaandrager, Frits ^b   Bodeveix, Jean Paul ^c   Filali, Mamoun ^c  

^a AALBORG UNIVERSITY   (Denmark)

^b RADBOUD UNIVERSITY NIJMEGEN   (Netherlands)

^c UNIVERSITÉ DE TOULOUSE   (France)

Author keywords

callable timed automata; Dynamic real time systems; timed automata

Indexed keywords

REAL TIME SYSTEMS; SEMANTICS; SOFTWARE ENGINEERING; TOOLS;

DYNAMIC REAL-TIME SYSTEMS; FORMAL FRAMEWORK; MODEL AND ANALYSIS; MODELING AND VERIFICATIONS; OBJECT-BASED SYSTEMS; PROTOTYPE TOOLS; TIMED AUTOMATA; UPPAAL SYSTEM;

AUTOMATA THEORY;

EID: 84886405176     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-40213-5_8     Document Type: Conference Paper

References (29)

1. Alur, R., Dill, D.L.: Automata for modeling real-time systems. In: Paterson, M. (ed.) ICALP 1990. LNCS, vol. 443, pp. 322-335. Springer, Heidelberg (1990)
2. Alur, R., Etessami, K., Madhusudan, P.: A temporal logic of nested calls and returns. In: Jensen, K., Podelski, A. (eds.) TACAS 2004. LNCS, vol. 2988, pp. 467-481. Springer, Heidelberg (2004)
3. Aspnes, J., Ruppert, E.: An introduction to population protocols. Bulletin of the European Association for Theoretical Computer Science 93, 98-117 (2007)
4. Baier, C., Bertrand, N., Bouyer, P., Brihaye, T.: When are timed automata determinizable? In: Albers, S., Marchetti-Spaccamela, A., Matias, Y., Nikoletseas, S., Thomas, W. (eds.) ICALP 2009, Part II. LNCS, vol. 5556, pp. 43-54. Springer, Heidelberg (2009)
5. Beffara, E.: Functions as proofs as processes. CoRR, abs/1107.4160 (2011)
6. Behrmann, G., David, A., Larsen, K.G.: A Tutorial on Uppaal 4.0. Department of computer science, Aalborg university (2006)
7. Berendsen, J., Vaandrager, F.: Parallel composition in a paper of Jensen, Larsen and Skou is not associative (2007), Technical note available at http://www.ita.cs.ru.nl/publications/papers/fvaan/BV07.html
8. Berendsen, J., Vaandrager, F.: Compositional Abstraction in Real-Time Model Checking. In: Cassez, F., Jard, C. (eds.) FORMATS 2008. LNCS, vol. 5215, pp. 233-249. Springer, Heidelberg (2008)
9. Berendsen, J., Vaandrager, F.: Parallel composition in a paper by de Alfaro e.a. is not associative (2008), Technical note available at http://www.ita.cs.ru.nl/publications/papers/fvaan/BV07.html
10. Berthomieu, B., Ribet, P.O., Vernadat, F.: The tool tina-construction of abstract state spaces for petri nets and time petri nets. Intl Journal of Production Research 42 (2004)
11. Bodeveix, J.-P., Boudjadar, A., Filali, M.: An alternative definition for timed automata composition. In: Bultan, T., Hsiung, P.-A. (eds.) ATVA 2011. LNCS, vol. 6996, pp. 105-119. Springer, Heidelberg (2011)
12. Boudol, G.: Towards a lambda-calculus for concurrent and communicating systems. In: Díaz, J., Orejas, F. (eds.) TAPSOFT 1989. LNCS, vol. 351, pp. 149-161. Springer, Heidelberg (1989)
13. Burns, A., Wellings, A.: Concurrency in Ada, 2nd edn. Cambridge University Press (1998)
14. de Alfaro, L., da Silva, L.D., Faella, M., Legay, A., Roy, P., Sorea, M.: Sociable interfaces. In: Gramlich, B. (ed.) FroCos 2005. LNCS (LNAI), vol. 3717, pp. 81-105. Springer, Heidelberg (2005)
15. Engberg, U., Nielsen, M.: A calculus of communicating systems with label passing. Technical report, Computer Science Department, University of Aarhus (1986)
16. Feiler, P.H., Lewis, B., Vestal, S.: The Sae architecture analysis and design language (AADL) standard: A basis for model-based architecture-driven embedded systems engineering. In: RTAS, Workshop, pp. 1-10 (2003)
17. Håkansson, J., Pettersson, P.: Partial order reduction for verification of real-time components. In: Raskin, J.-F., Thiagarajan, P.S. (eds.) FORMATS 2007. LNCS, vol. 4763, pp. 211-226. Springer, Heidelberg (2007)
18. Holzmann, G.: Spin model checker, the: primer and reference manual, 1st edn. Addison-Wesley Professional (2003)
19. Igna, G., et al.: Formal modeling and scheduling of datapaths of digital document printers. In: Cassez, F., Jard, C. (eds.) FORMATS 2008. LNCS, vol. 5215, pp. 170-187. Springer, Heidelberg (2008)
20. Jensen, H.E., Guldstr, K., Skou, A.: Scaling up Uppaal:Automatic Verification of Real-Time Systems using Compositionality and Abstraction. In: Joseph, M. (ed.) FTRTFT 2000. LNCS, vol. 1926, pp. 19-30. Springer, Heidelberg (2000)
21. Larsen, K.G., Pettersson, P., Wang, Y.: Uppaal in a nutshell. Journal on Software Tools for Technology Transfert (1997)
22. Milner, R.: Functions as processes. In: Paterson, M. (ed.) ICALP 1990. LNCS, vol. 443, pp. 167-180. Springer, Heidelberg (1990)
23. Nielson, F.: The typed λ-calculus with first-class processes. In: Odijk, E., Rem, M., Syre, J.-C. (eds.) PARLE 1989. LNCS, vol. 366, pp. 357-373. Springer, Heidelberg (1989)
24. Patin, G., Sighireanu, M., Touili, T.: Spade: Verification of multithreaded dynamic and recursive programs. In: Damm, W., Hermanns, H. (eds.) CAV 2007. LNCS, vol. 4590, pp. 254-257. Springer, Heidelberg (2007)
25. Thomsen, B.: A calculus of higher order communicating systems. In: Proceedings of the 16th ACM Conference POPL 1989, pp. 143-154. ACM (1989)
26. Toninho, B., Caires, L., Pfenning, F.: Functions as session-typed processes. CoRR (2011), Paper available on http://ctp.di.fct.unl.pt/ ∼lcaires/papers/
27. Trivedi, A., Wojtczak, D.: Recursive timed automata. In: Bouajjani, A., Chin, W.-N. (eds.) ATVA 2010. LNCS, vol. 6252, pp. 306-324. Springer, Heidelberg (2010)
28. Warn, F.: Red: Model-checker for timed automata with clock-restriction diagram. In: Workshop on Real-time Tools (2001)
29. Yovine, S.: Kronos: A verification tool for real-time systems. Journal of Software Tools for Technology Transfer, 123-133 (1997)