Kleene Theorems for Event-Clock Automata. - Catalin Dima (FCT, 1999)

Real-Time Automata and the Kleene Algebra of Sets of Real Numbers. - Catalin Dima (STACS, 2000)

Off-Line Real-Time Fault-Tolerant Scheduling. - Catalin Dima; Alain Girault; Christophe Lavarenne; Yves Sorel (PDP, 2001)

Real-Time Automata. - Catalin Dima (J. Autom. Lang. Comb., 2001)

An algebraic theory of real-time formal languages. (Théorie algébrique des langages formels temps réel). - Catalin Dima (2001)

Computing Reachability Relations in Timed Automata. - Catalin Dima (LICS, 2002)

Balanced timed regular expressions. - Eugene Asarin; Catalin Dima (MTCS, 2002)

Distributed Real-Time Automata. - Catalin Dima (Grammars and Automata for String Processing, 2003)

Regular Expressions with Timed Dominoes. - Catalin Dima (DMTCS, 2003)

Static Fault-Tolerant Real-Time Scheduling with "Pseudo-topological" Orders. - Catalin Dima; Alain Girault; Yves Sorel (FORMATS/FTRTFT, 2004)

Timed Shuffle Expressions. - Catalin Dima (CONCUR, 2005)

A Class of Automata for Computing Reachability Relations in Timed Systems. - Catalin Dima (VISSAS, 2005)

Preface. - Catalin Dima; Marius Minea; Ferucio Laurentiu Tiplea (ICS@SYNASC, 2006)

Abstractions of Multi-agent Systems. - Constantin Enea; Catalin Dima (CEEMAS, 2007)

Dynamical Properties of Timed Automata Revisited. - Catalin Dima (FORMATS, 2007)

Distributed Time-Asynchronous Automata. - Catalin Dima; Ruggero Lanotte (ICTAC, 2007)

Strategy-Based and Knowledge-Based Models of Information Flow: Equivalence and Decidability. - Catalin Dima; Constantin Enea; Radu Gramatovici; Alexandru Sofronia (SYNASC, 2007)

Revisiting Satisfiability and Model-Checking for CTLK with Synchrony and Perfect Recall. - Catalin Dima (CLIMA, 2008)

Model-Checking Strategic Ability and Knowledge of the Past of Communicating Coalitions. - Dimitar P. Guelev; Catalin Dima (DALT, 2008)

Removing All Silent Transitions from Timed Automata. - Catalin Dima; Ruggero Lanotte (FORMATS, 2009)

Positive and Negative Results on the Decidability of the Model-Checking Problem for an Epistemic Extension of Timed CTL. - Catalin Dima (TIME, 2009)

Model-Checking an Alternating-time Temporal Logic with Knowledge, Imperfect Information, Perfect Recall and Communicating Coalitions - Catalin Dima; Constantin Enea; Dimitar P. Guelev (GANDALF, 2010)

On the computation of covert channel capacity. - Eugene Asarin; Catalin Dima (RAIRO Theor. Informatics Appl., 2010)

Model-checking ATL under Imperfect Information and Perfect Recall Semantics is Undecidable - Catalin Dima; Ferucio Laurentiu Tiplea (CoRR, 2011)

An alternating-time temporal logic with knowledge, perfect recall and past: axiomatisation and model-checking. - Dimitar P. Guelev; Catalin Dima; Constantin Enea (J. Appl. Non Class. Logics, 2011)

Non-axiomatizability for the linear temporal logic of knowledge with concrete observability. - Catalin Dima (J. Log. Comput., 2011)

Epistemic ATL with Perfect Recall, Past and Strategy Contexts. - Dimitar P. Guelev; Catalin Dima (CLIMA, 2012)

Model-Checking Alternating-Time Temporal Logic with Strategies Based on Common Knowledge is Undecidable. - Raluca Diaconu; Catalin Dima (Appl. Artif. Intell., 2012)

Model-checking an Epistemic μ-calculus with Synchronous and Perfect Recall Semantics - Rodica Bozianu; Catalin Dima; Constantin Enea (CoRR, 2012)

A study on shuffle, stopwatches and independently evolving clocks. - Catalin Dima; Ruggero Lanotte (Distributed Comput., 2012)

Efficient Operational Semantics for for Verification of Temporal Properties. - Dimitris Vekris; Catalin Dima (FSEN, 2013)

Model checking an Epistemic mu-calculus with Synchronous and Perfect Recall Semantics. - Rodica Bozianu; Catalin Dima; Constantin Enea (TARK, 2013)

Finite-type-Dyck shift spaces. - Marie-Pierre Béal; Michel Blockelet; Catalin Dima (CoRR, 2013)

Safraless Synthesis for Epistemic Temporal Specifications. - Rodica Bozianu; Catalin Dima; Emmanuel Filiot (CAV, 2014)

Asymptotic behaviour in temporal logic. - Eugene Asarin; Michel Blockelet; Aldric Degorre; Catalin Dima; Chunyan Mu (CSL-LICS, 2014)

Zeta functions of finite-type-Dyck shifts are N-algebraic. - Marie-Pierre Béal; Michel Blockelet; Catalin Dima (ITA, 2014)

The Expressive Power of Epistemic $μ$-Calculus. - Catalin Dima; Bastien Maubert; Sophie Pinchinat (CoRR, 2014)

A Nonarchimedian Discretization for Timed Languages. - Catalin Dima (Fundam. Informaticae, 2014)

Entropy Games. - Eugene Asarin; Julien Cervelle; Aldric Degorre; Catalin Dima; Florian Horn 001; Victor S. Kozyakin (CoRR, 2015)

Entropy Games and Matrix Multiplication Games. - Eugene Asarin; Julien Cervelle; Aldric Degorre; Catalin Dima; Florian Horn 001; Victor S. Kozyakin (STACS, 2016)

Verification of EB3 specifications using CADP. - Dimitris Vekris; Frédéric Lang; Catalin Dima; Radu Mateescu 001 (Formal Aspects Comput., 2016)

Sofic-Dyck shifts. - Marie-Pierre Béal; Michel Blockelet; Catalin Dima (Theor. Comput. Sci., 2016)

Bisimulations for Verifying Strategic Abilities with an Application to ThreeBallot. - Francesco Belardinelli; Rodica Condurache; Catalin Dima; Wojciech Jamroga; Andrew V. Jones (AAMAS, 2017)

Bisimulations for Logics of Strategies: A Study in Expressiveness and Verification. - Francesco Belardinelli; Catalin Dima; Aniello Murano (KR, 2018)

Relating Paths in Transition Systems: The Fall of the Modal Mu-Calculus. - Catalin Dima; Bastien Maubert; Sophie Pinchinat (ACM Trans. Comput. Log., 2018)

Verifying Strategic Abilities in Multi-agent Systems with Private Data-Sharing. - Francesco Belardinelli; Ioana Boureanu; Catalin Dima; Vadim Malvone (AAMAS, 2019)

Model Checking ATL* on vCGS. - Francesco Belardinelli; Catalin Dima; Ioana Boureanu; Vadim Malvone (CoRR, 2019)

A Hennessy-Milner Theorem for ATL with Imperfect Information. - Francesco Belardinelli; Catalin Dima; Vadim Malvone; Ferucio Laurentiu Tiplea (LICS, 2020)

Rational Synthesis in the Commons with Careless and Careful Agents. - Rodica Condurache; Catalin Dima; Youssouf Oualhadj; Nicolas Troquard (AAMAS, 2021)

Bisimulations for verifying strategic abilities with an application to the ThreeBallot voting protocol. - Francesco Belardinelli; Rodica Condurache; Catalin Dima; Wojciech Jamroga; Michal Knapik (Inf. Comput., 2021)

Careful Autonomous Agents in Environments With Multiple Common Resources. - Rodica Condurache; Catalin Dima; Madalina Jitaru; Youssouf Oualhadj; Nicolas Troquard (AREA@IJCAI-ECAI, 2022)

Synthesis of Resource-Aware Controllers Against Rational Agents. - Rodica Condurache; Catalin Dima; Youssouf Oualhadj; Nicolas Troquard (AAMAS, 2023)

Computationally Feasible Strategies. - Catalin Dima; Wojciech Jamroga (AAMAS, 2023)

Observational Preorders for Alternating Transition Systems. - Romain Demangeon; Catalin Dima; Daniele Varacca (EUMAS, 2023)

Bandwidth of Timed Automata: 3 Classes. - Eugene Asarin; Aldric Degorre; Catalin Dima; Bernardo Jacobo Inclán (FSTTCS, 2023)

Deciding the Synthesis Problem for Hybrid Games Through Bisimulation. - Catalin Dima; Mariem Hammami; Youssouf Oualhadj; Régine Laleau (ICFEM, 2024)

Computing the Bandwidth of Meager Timed Automata. - Eugene Asarin; Aldric Degorre; Catalin Dima; Bernardo Jacobo Inclán (CIAA, 2024)

Controller synthesis in timed Büchi automata: Robustness and punctual guards. - Benoît Barbot; Damien Busatto-Gaston; Catalin Dima; Youssouf Oualhadj (Perform. Evaluation, 2025)

Model-checking Strategic Abilities in Information-sharing Systems. - Francesco Belardinelli; Ioana Boureanu; Catalin Dima; Vadim Malvone (ACM Trans. Comput. Log., 2025)