Catalin Dima
Catalin Dima
Professor of Computer Science, Université Paris-Est Créteil, France
Η διεύθυνση ηλεκτρονικού ταχυδρομείου έχει επαληθευτεί στον τομέα - Αρχική σελίδα
Παρατίθεται από
Παρατίθεται από
Model-checking ATL under imperfect information and perfect recall semantics is undecidable
C Dima, FL Tiplea
arXiv preprint arXiv:1102.4225, 2011
Off-line real-time fault-tolerant scheduling
C Dima, A Girault, C Lavarenne, Y Sorel
Proceedings Ninth Euromicro Workshop on Parallel and Distributed Processing …, 2001
Real-time automata
C Dima
Journal of Automata, Languages and Combinatorics 6 (1), 3-24, 2001
An alternating-time temporal logic with knowledge, perfect recall and past: axiomatisation and model-checking
DP Guelev, C Dima, C Enea
Journal of Applied Non-Classical Logics 21 (1), 93-131, 2011
Balanced timed regular expressions
E Asarin, C Dima
Electronic Notes in Theoretical Computer Science 68 (5), 16-33, 2003
Computing reachability relations in timed automata
C Dima
Proceedings 17th Annual IEEE Symposium on Logic in Computer Science, 177-186, 2002
Model-checking an alternating-time temporal logic with knowledge, imperfect information, perfect recall and communicating coalitions
C Dima, C Enea, D Guelev
arXiv preprint arXiv:1006.1414, 2010
Distributed time-asynchronous automata
C Dima, R Lanotte
International Colloquium on Theoretical Aspects of Computing, 185-200, 2007
Revisiting satisfiability and model-checking for CTLK with synchrony and perfect recall
C Dima
International Workshop on Computational Logic in Multi-Agent Systems, 117-131, 2008
Dynamical properties of timed automata revisited
C Dima
International Conference on Formal Modeling and Analysis of Timed Systems …, 2007
Nondeterministic nointerference and deducible information flow
C Dima, C Enea, R Gramatovici
Technical Report 2006-01, University of Paris 12, LACL, 2006
Real-time automata and the Kleene algebra of sets of real numbers
C Dima
Annual Symposium on Theoretical Aspects of Computer Science, 279-289, 2000
Kleene theorems for event-clock automata
C Dima
International Symposium on Fundamentals of Computation Theory, 215-225, 1999
Bisimulations for verifying strategic abilities with an application to threeballot
F Belardinelli, R Condurache, C Dima, W Jamroga, AV Jones
Proceedings of the 16th Conference on Autonomous Agents and MultiAgent …, 2017
Relating paths in transition systems: The fall of the modal mu-calculus
C Dima, B Maubert, S Pinchinat
International Symposium on Mathematical Foundations of Computer Science, 179-191, 2015
Abstractions of multi-agent systems
C Enea, C Dima
International Central and Eastern European Conference on Multi-Agent Systems …, 2007
Entropy games and matrix multiplication games
E Asarin, J Cervelle, A Degorre, C Dima, F Horn, V Kozyakin
arXiv preprint arXiv:1506.04885, 2015
Sofic-Dyck shifts
MP Béal, M Blockelet, C Dima
Theoretical Computer Science 609, 226-244, 2016
An algebraic theory of real-time formal languages
C Dima
Université Joseph-Fourier-Grenoble I, 2001
Epistemic ATL with Perfect Recall, Past and Strategy Contexts
DP Guelev, C Dima
International Workshop on Computational Logic in Multi-Agent Systems, 77-93, 2012
Δεν είναι δυνατή η εκτέλεση της ενέργειας από το σύστημα αυτή τη στιγμή. Προσπαθήστε ξανά αργότερα.
Άρθρα 1–20