| 2009 | ||
|---|---|---|
| 19 | Catalin Dima, Ruggero Lanotte: Removing All Silent Transitions from Timed Automata. FORMATS 2009: 118-132 | |
| 2008 | ||
| 18 | Catalin Dima: Revisiting Satisfiability and Model-Checking for CTLK with Synchrony and Perfect Recall. CLIMA IX 2008: 117-131 | |
| 17 | Dimitar P. Guelev, Catalin Dima: Model-Checking Strategic Ability and Knowledge of the Past of Communicating Coalitions. DALT 2008: 75-90 | |
| 2007 | ||
| 16 | Constantin Enea, Catalin Dima: Abstractions of Multi-agent Systems. CEEMAS 2007: 11-21 | |
| 15 | Catalin Dima: Dynamical Properties of Timed Automata Revisited. FORMATS 2007: 130-146 | |
| 14 | Catalin Dima, Ruggero Lanotte: Distributed Time-Asynchronous Automata. ICTAC 2007: 185-200 | |
| 13 | Catalin Dima, Constantin Enea, Radu Gramatovici, Alexandru Sofronia: Strategy-Based and Knowledge-Based Models of Information Flow: Equivalence and Decidability. SYNASC 2007: 33-40 | |
| 12 | Catalin Dima, Marius Minea, Ferucio Laurentiu Tiplea: Preface. Electr. Notes Theor. Comput. Sci. 186: 1-2 (2007) | |
| 2005 | ||
| 11 | Catalin Dima: Timed Shuffle Expressions. CONCUR 2005: 95-109 | |
| 10 | Catalin Dima: A Class of Automata for Computing Reachability Relations in Timed Systems. VISSAS 2005: 69-89 | |
| 2004 | ||
| 9 | Catalin Dima, Alain Girault, Yves Sorel: Static Fault-Tolerant Real-Time Scheduling with "Pseudo-topological" Orders. FORMATS/FTRTFT 2004: 215-230 | |
| 2003 | ||
| 8 | Catalin Dima: Regular Expressions with Timed Dominoes. DMTCS 2003: 141-154 | |
| 7 | Catalin Dima: A Nonarchimedian Discretization for Timed Languages. FORMATS 2003: 168-181 | |
| 6 | Catalin Dima: Distributed Real-Time Automata. Grammars and Automata for String Processing 2003: 131-140 | |
| 2002 | ||
| 5 | Catalin Dima: Computing Reachability Relations in Timed Automata. LICS 2002: 177- | |
| 4 | Eugene Asarin, Catalin Dima: Balanced timed regular expressions. Electr. Notes Theor. Comput. Sci. 68(5): (2002) | |
| 2001 | ||
| 3 | Catalin Dima: Real-Time Automata. Journal of Automata, Languages and Combinatorics 6(1): 3-24 (2001) | |
| 2000 | ||
| 2 | Catalin Dima: Real-Time Automata and the Kleene Algebra of Sets of Real Numbers. STACS 2000: 279-289 | |
| 1999 | ||
| 1 | Catalin Dima: Kleene Theorems for Event-Clock Automata. FCT 1999: 215-225 | |