Get started
Author

Cătălin Dima

Observed names: C. Dima, Catalin Dima, Cǎtǎlin Dima, Cǎtǎlin Dima, DIMA C, Dima C., Dima, C\u{a}t\u{a}lin, Dima, Catalin, Dima, Cătălin, Dima, Cǎtǎlin
Observed institutions: Institut national de recherche en sciences et technologies du numérique, University of Bucharest, Université Paris-Est Créteil, Paris-Est Sup, Centre Inria de l'Université Grenoble Alpes, Laboratoire Bordelais de Recherche en Informatique, Verimag, Laboratoire d'Algorithmique, Complexité et Logique, Pôle de recherche et d'enseignement supérieur Université Paris-Est
ORCID: 0000-0001-5981-4533
Observed ORCID: 0000-0001-5981-4533
OpenAlex ID: A5069463747
Model-checking ATL under Imperfect Information and Perfect Recall Semantics is Undecidable
2011 · Dima, Catalin, Tiplea, Ferucio Laurentiu · arXiv (Cornell University) · 75
PDF
Off-line real-time fault-tolerant scheduling
2002 · C. Dima, A. Girault, et al. · Proceedings - Euromicro Workshop on Parallel and Distributed Processing/Proceedings · 45
An alternating-time temporal logic with knowledge, perfect recall and past: axiomatisation and model-checking
2011 · Dimitar P. Guelev, Catalin Dima, et al. · Journal of Applied Non-Classical Logics · 37
Real-time automata
2001 · Cătălin Dima · Journal of automata, languages and combinatorics · 30
Model-Checking an Alternating-time Temporal Logic with Knowledge, Imperfect Information, Perfect Recall and Communicating Coalitions
2010 · Cătălin Dima, Constantin Enea, et al. · Electronic Proceedings in Theoretical Computer Science · 29
PDF
Computing reachability relations in timed automata
2003 · C. Dima · Proceedings - Symposium on Logic in Computer Science · 20
Revisiting Satisfiability and Model-Checking for CTLK with Synchrony and Perfect Recall
2009 · Cătălin Dima · Lecture notes in computer science · 18
Abstractions of Multi-agent Systems
2007 · Constantin Enea, Catalin Dima · Lecture notes in computer science · 18
Balanced timed regular expressions1 1Partially supported by the European community project IST-2001-35304 AMETIST
2003 · Eugene Asarin, Cătălin Dima · Electronic Notes in Theoretical Computer Science · 18
PDF
Distributed Time-Asynchronous Automata
2007 · Cătălin Dima, Ruggero Lanotte · Lecture notes in computer science · 17
Real-Time Automata and the Kleene Algebra of Sets of Real Numbers
2000 · Cătălin Dima · Lecture notes in computer science · 16
Dynamical Properties of Timed Automata Revisited
2007 · Cătălin Dima · Lecture notes in computer science · 15
Bisimulations for Verifying Strategic Abilities with an Application to ThreeBallot
2017 · Francesco Belardinelli, Rodica Condurache, et al. · Adaptive Agents and Multi-Agents Systems · 13
Relating Paths in Transition Systems: The Fall of the Modal Mu-Calculus
2015 · Cătălin Dima, Bastien Maubert, et al. · Lecture notes in computer science · 12
Kleene theorems for event-clock automata
1999 · Cătălin Dima · Lecture notes in computer science · 12
Entropy Games and Matrix Multiplication Games
2015 · Asarin, Eugene, Cervelle, Julien, et al. · arXiv (Cornell University) · 11
Epistemic ATL with Perfect Recall, Past and Strategy Contexts
2012 · Dimitar P. Guelev, Catalin Dima · Lecture notes in computer science · 10
Bisimulations for verifying strategic abilities with an application to the ThreeBallot voting protocol
2020 · Francesco Belardinelli, Rodica Condurache, et al. · Information and Computation · 9
Sofic-Dyck shifts
2015 · Marie-Pierre Béal, Michel Blockelet, et al. · Theoretical Computer Science · 8
PDF
Regular Expressions with Timed Dominoes
2003 · Cătălin Dima · Lecture notes in computer science · 8
Safraless Synthesis for Epistemic Temporal Specifications
2014 · Rodica Bozianu, Cătălin Dima, et al. · Lecture notes in computer science · 7
PDF
Model-checking Alternating-time Temporal Logic With Strategies Based on Common Knowledge Is Undecidable
2012 · Raluca Diaconu, Cătălin Dima · Applied Artificial Intelligence · 7
PDF
Bisimulations for Logics of Strategies: A Study in Expressiveness and Verification
2018 · Francesco Belardinelli, Cătălin Dima, et al. · 6
Sofic-Dyck Shifts
2014 · Marie-Pierre Béal, Michel Blockelet, et al. · Lecture notes in computer science · 5
Positive and Negative Results on the Decidability of the Model-Checking Problem for an Epistemic Extension of Timed CTL
2009 · Catalin Dima · International Symposium on Temporal Representation and Reasoning · 5
Works count: 101
Citation count: 543
H-index: 13
I10-index: 17
Year
Topic
Type