The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Catalin Dima: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Catalin Dima
    Distributed Real-Time Automata. [Citation Graph (0, 0)][DBLP]
    Grammars and Automata for String Processing, 2003, pp:131-140 [Conf]
  2. Catalin Dima
    Timed Shuffle Expressions. [Citation Graph (0, 0)][DBLP]
    CONCUR, 2005, pp:95-109 [Conf]
  3. Catalin Dima
    Regular Expressions with Timed Dominoes. [Citation Graph (0, 0)][DBLP]
    DMTCS, 2003, pp:141-154 [Conf]
  4. Catalin Dima
    Kleene Theorems for Event-Clock Automata. [Citation Graph (0, 0)][DBLP]
    FCT, 1999, pp:215-225 [Conf]
  5. Catalin Dima
    A Nonarchimedian Discretization for Timed Languages. [Citation Graph (0, 0)][DBLP]
    FORMATS, 2003, pp:168-181 [Conf]
  6. 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]
  7. Catalin Dima
    Computing Reachability Relations in Timed Automata. [Citation Graph (0, 0)][DBLP]
    LICS, 2002, pp:177-0 [Conf]
  8. 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]
  9. Catalin Dima
    A Class of Automata for Computing Reachability Relations in Timed Systems. [Citation Graph (0, 0)][DBLP]
    VISSAS, 2005, pp:69-89 [Conf]
  10. 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]
  11. 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]
  12. Constantin Enea, Catalin Dima
    Abstractions of Multi-agent Systems. [Citation Graph (0, 0)][DBLP]
    CEEMAS, 2007, pp:11-21 [Conf]
  13. Catalin Dima
    Dynamical Properties of Timed Automata Revisited. [Citation Graph (0, 0)][DBLP]
    FORMATS, 2007, pp:130-146 [Conf]
  14. Catalin Dima, Ruggero Lanotte
    Distributed Time-Asynchronous Automata. [Citation Graph (0, 0)][DBLP]
    ICTAC, 2007, pp:185-200 [Conf]
  15. 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]

  16. Revisiting Satisfiability and Model-Checking for CTLK with Synchrony and Perfect Recall. [Citation Graph (, )][DBLP]


  17. Model-Checking Strategic Ability and Knowledge of the Past of Communicating Coalitions. [Citation Graph (, )][DBLP]


  18. Removing All Silent Transitions from Timed Automata. [Citation Graph (, )][DBLP]


  19. Off-Line Real-Time Fault-Tolerant Scheduling. [Citation Graph (, )][DBLP]


  20. Positive and Negative Results on the Decidability of the Model-Checking Problem for an Epistemic Extension of Timed CTL. [Citation Graph (, )][DBLP]


  21. Strategy-Based and Knowledge-Based Models of Information Flow: Equivalence and Decidability. [Citation Graph (, )][DBLP]


Search in 0.004secs, Finished in 0.005secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002