|
Search the dblp DataBase
Catalin Dima:
[Publications]
[Author Rank by year]
[Co-authors]
[Prefers]
[Cites]
[Cited by]
Publications of Author
- Catalin Dima
Distributed Real-Time Automata. [Citation Graph (0, 0)][DBLP] Grammars and Automata for String Processing, 2003, pp:131-140 [Conf]
- Catalin Dima
Timed Shuffle Expressions. [Citation Graph (0, 0)][DBLP] CONCUR, 2005, pp:95-109 [Conf]
- Catalin Dima
Regular Expressions with Timed Dominoes. [Citation Graph (0, 0)][DBLP] DMTCS, 2003, pp:141-154 [Conf]
- Catalin Dima
Kleene Theorems for Event-Clock Automata. [Citation Graph (0, 0)][DBLP] FCT, 1999, pp:215-225 [Conf]
- Catalin Dima
A Nonarchimedian Discretization for Timed Languages. [Citation Graph (0, 0)][DBLP] FORMATS, 2003, pp:168-181 [Conf]
- Catalin Dima, Alain Girault, Yves Sorel
Static Fault-Tolerant Real-Time Scheduling with "Pseudo-topological" Orders. [Citation Graph (0, 0)][DBLP] FORMATS/FTRTFT, 2004, pp:215-230 [Conf]
- Catalin Dima
Computing Reachability Relations in Timed Automata. [Citation Graph (0, 0)][DBLP] LICS, 2002, pp:177-0 [Conf]
- Catalin Dima
Real-Time Automata and the Kleene Algebra of Sets of Real Numbers. [Citation Graph (0, 0)][DBLP] STACS, 2000, pp:279-289 [Conf]
- Catalin Dima
A Class of Automata for Computing Reachability Relations in Timed Systems. [Citation Graph (0, 0)][DBLP] VISSAS, 2005, pp:69-89 [Conf]
- Eugene Asarin, Catalin Dima
Balanced timed regular expressions. [Citation Graph (0, 0)][DBLP] Electr. Notes Theor. Comput. Sci., 2002, v:68, n:5, pp:- [Journal]
- Catalin Dima
Real-Time Automata. [Citation Graph (0, 0)][DBLP] Journal of Automata, Languages and Combinatorics, 2001, v:6, n:1, pp:3-24 [Journal]
- Constantin Enea, Catalin Dima
Abstractions of Multi-agent Systems. [Citation Graph (0, 0)][DBLP] CEEMAS, 2007, pp:11-21 [Conf]
- Catalin Dima
Dynamical Properties of Timed Automata Revisited. [Citation Graph (0, 0)][DBLP] FORMATS, 2007, pp:130-146 [Conf]
- Catalin Dima, Ruggero Lanotte
Distributed Time-Asynchronous Automata. [Citation Graph (0, 0)][DBLP] ICTAC, 2007, pp:185-200 [Conf]
- Catalin Dima, Marius Minea, Ferucio Laurentiu Tiplea
Preface. [Citation Graph (0, 0)][DBLP] Electr. Notes Theor. Comput. Sci., 2007, v:186, n:, pp:1-2 [Journal]
Revisiting Satisfiability and Model-Checking for CTLK with Synchrony and Perfect Recall. [Citation Graph (, )][DBLP]
Model-Checking Strategic Ability and Knowledge of the Past of Communicating Coalitions. [Citation Graph (, )][DBLP]
Removing All Silent Transitions from Timed Automata. [Citation Graph (, )][DBLP]
Off-Line Real-Time Fault-Tolerant Scheduling. [Citation Graph (, )][DBLP]
Positive and Negative Results on the Decidability of the Model-Checking Problem for an Epistemic Extension of Timed CTL. [Citation Graph (, )][DBLP]
Strategy-Based and Knowledge-Based Models of Information Flow: Equivalence and Decidability. [Citation Graph (, )][DBLP]
Search in 0.003secs, Finished in 0.004secs
|