1. Allmaier S, Dalibor S, Kreische D (1997) Parallel graph generation algorithms for shared and distributed memory machines. In: Proceedings of the international conference on parallel computing: fundamentals, applications and new directions (ParCo’97), Bonn, Germany, 16–19 September 1997, vol 12, Elsevier, Amsterdam
2. Alur R, Dill DL (1994) A theory of timed automata. Theor Comp Sci 126:183–235
3. Amnell T, Behrmann G, Bengtsson J, D’Argenio PD, David A, Fehnker A, Hune TS, Jeannet B, Larsen K, Möller O, Pettersson P, Weise C, Yi W (2000) Uppaal – now, next, and future. In: Modeling and verification of parallel processes, 4th summer school (MOVEP 2000), Nantes, France, 19–23 June 2000. Lecture notes in computer science, vol 2067, Springer, Berlin Heidelberg New York
4. Behrmann G (2002) A performance study of distributed timed automata reachability analysis. In: Brim L, Grumberg O (eds) Electronic notes in theoretical computer science, vol 68, Elsevier, Amsterdam
5. Behrmann G, Bouyer P, Fleury E, Larsen KG (2003) Static guard analysis in timed automata verification. In: Proceedings of the 9th international conference on tools and algorithms for the construction and analysis of systems (TACAS03), Warsaw, Poland, 7–11 April 2003. Lecture notes in computer science, vol 2619, Springer, Berlin Heidelberg New York