| 2008 |
|---|
| 17 | EE | Dimitar P. Guelev,
Catalin Dima:
Model-Checking Strategic Ability and Knowledge of the Past of Communicating Coalitions.
DALT 2008: 75-90 |
| 2007 |
|---|
| 16 | EE | Constantin Enea,
Catalin Dima:
Abstractions of Multi-agent Systems.
CEEMAS 2007: 11-21 |
| 15 | EE | Catalin Dima:
Dynamical Properties of Timed Automata Revisited.
FORMATS 2007: 130-146 |
| 14 | EE | Catalin Dima,
Ruggero Lanotte:
Distributed Time-Asynchronous Automata.
ICTAC 2007: 185-200 |
| 13 | EE | 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 | EE | Catalin Dima,
Marius Minea,
Ferucio Laurentiu Tiplea:
Preface.
Electr. Notes Theor. Comput. Sci. 186: 1-2 (2007) |
| 2005 |
|---|
| 11 | EE | 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 | EE | Catalin Dima,
Alain Girault,
Yves Sorel:
Static Fault-Tolerant Real-Time Scheduling with "Pseudo-topological" Orders.
FORMATS/FTRTFT 2004: 215-230 |
| 2003 |
|---|
| 8 | EE | Catalin Dima:
Regular Expressions with Timed Dominoes.
DMTCS 2003: 141-154 |
| 7 | EE | 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 | EE | Catalin Dima:
Computing Reachability Relations in Timed Automata.
LICS 2002: 177- |
| 4 | EE | 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 | EE | Catalin Dima:
Real-Time Automata and the Kleene Algebra of Sets of Real Numbers.
STACS 2000: 279-289 |
| 1999 |
|---|
| 1 | EE | Catalin Dima:
Kleene Theorems for Event-Clock Automata.
FCT 1999: 215-225 |
