Catalin Dima

ORCID

Publication Activity (10 Years)

Years Active: 1999-2024
Publications (10 Years): 24

Top Venues

Joseph Fourier University, Grenoble, France (PHD)

Education History

Joseph Fourier University, Grenoble, France

PHD

Publications

Benoît Barbot, Damien Busatto-Gaston, Catalin Dima, Youssouf Oualhadj
Controller Synthesis in Timed Büchi Automata: Robustness and Punctual Guards. CoRR (2024)
Eugene Asarin, Aldric Degorre, Catalin Dima, Bernardo Jacobo Inclán
Computing the Bandwidth of Meager Timed Automata. CoRR (2024)
Rodica Condurache, Catalin Dima, Youssouf Oualhadj, Nicolas Troquard
Synthesis of Resource-Aware Controllers Against Rational Agents. AAMAS (2023)
Catalin Dima, Wojciech Jamroga
Computationally Feasible Strategies. CoRR (2023)
Romain Demangeon, Catalin Dima, Daniele Varacca
Observational Preorders for Alternating Transition Systems. EUMAS (2023)
Catalin Dima, Wojciech Jamroga
Computationally Feasible Strategies. AAMAS (2023)
Eugene Asarin, Aldric Degorre, Catalin Dima, Bernardo Jacobo Inclán
Bandwidth of Timed Automata: 3 Classes. FSTTCS (2023)
Eugene Asarin, Aldric Degorre, Catalin Dima, Bernardo Jacobo Inclán
Bandwidth of Timed Automata: 3 Classes. CoRR (2023)
Francesco Belardinelli, Rodica Condurache, Catalin Dima, Wojciech Jamroga, Michal Knapik
Bisimulations for Verifying Strategic Abilities with an Application to the ThreeBallot Voting Protocol. CoRR (2022)
Rodica Condurache, Catalin Dima, Madalina Jitaru, Youssouf Oualhadj, Nicolas Troquard
Careful Autonomous Agents in Environments With Multiple Common Resources. AREA@IJCAI-ECAI (2022)
Francesco Belardinelli, Ioana Boureanu, Catalin Dima, Vadim Malvone
Model Checking Strategic Abilities in Information-sharing Systems. CoRR (2022)
Rodica Condurache, Catalin Dima, Youssouf Oualhadj, Nicolas Troquard
Rational Synthesis in the Commons with Careless and Careful Agents. AAMAS (2021)
Francesco Belardinelli, Rodica Condurache, Catalin Dima, Wojciech Jamroga, Michal Knapik
Bisimulations for verifying strategic abilities with an application to the ThreeBallot voting protocol. Inf. Comput. 276 (2021)
Francesco Belardinelli, Catalin Dima, Vadim Malvone, Ferucio Laurentiu Tiplea
A Hennessy-Milner Theorem for ATL with Imperfect Information. LICS (2020)
Francesco Belardinelli, Catalin Dima, Vadim Malvone, Ferucio Laurentiu Tiplea
A Hennessy-Milner Theorem for ATL with Imperfect Information. CoRR (2020)
Francesco Belardinelli, Catalin Dima, Ioana Boureanu, Vadim Malvone
Model Checking ATL* on vCGS. CoRR (2019)
Francesco Belardinelli, Ioana Boureanu, Catalin Dima, Vadim Malvone
Verifying Strategic Abilities in Multi-agent Systems with Private Data-Sharing. AAMAS (2019)
Francesco Belardinelli, Catalin Dima, Aniello Murano
Bisimulations for Logics of Strategies: A Study in Expressiveness and Verification. KR (2018)
Catalin Dima, Bastien Maubert, Sophie Pinchinat
Relating Paths in Transition Systems: The Fall of the Modal Mu-Calculus. ACM Trans. Comput. Log. 19 (3) (2018)
Francesco Belardinelli, Rodica Condurache, Catalin Dima, Wojciech Jamroga, Andrew V. Jones
Bisimulations for Verifying Strategic Abilities with an Application to ThreeBallot. AAMAS (2017)
Dimitris Vekris, Frédéric Lang, Catalin Dima, Radu Mateescu
specifications using CADP. Formal Aspects Comput. 28 (1) (2016)
Catalin Dima, Bastien Maubert, Sophie Pinchinat
Relating Paths in Transition Systems: the Fall of the Modal mu-Calculus. ICTCS (2016)
Eugene Asarin, Julien Cervelle, Aldric Degorre, Catalin Dima, Florian Horn, Victor S. Kozyakin
Entropy Games and Matrix Multiplication Games. STACS (2016)
Marie-Pierre Béal, Michel Blockelet, Catalin Dima
Sofic-Dyck shifts. Theor. Comput. Sci. 609 (2016)
Catalin Dima, Bastien Maubert, Sophie Pinchinat
Relating Paths in Transition Systems: The Fall of the Modal Mu-Calculus. MFCS (1) (2015)
Eugene Asarin, Julien Cervelle, Aldric Degorre, Catalin Dima, Florian Horn, Victor S. Kozyakin
Entropy Games. CoRR (2015)
Catalin Dima, Bastien Maubert, Sophie Pinchinat
The Expressive Power of Epistemic $μ$-Calculus. CoRR (2014)
Marie-Pierre Béal, Michel Blockelet, Catalin Dima
Zeta functions of finite-type-Dyck shifts are N-algebraic. ITA (2014)
Marie-Pierre Béal, Michel Blockelet, Catalin Dima
Sofic-Dyck Shifts. MFCS (1) (2014)
Eugene Asarin, Michel Blockelet, Aldric Degorre, Catalin Dima, Chunyan Mu
Asymptotic behaviour in temporal logic. CSL-LICS (2014)
Catalin Dima
A Nonarchimedian Discretization for Timed Languages. Fundam. Informaticae 131 (3-4) (2014)
Rodica Bozianu, Catalin Dima, Emmanuel Filiot
Safraless Synthesis for Epistemic Temporal Specifications. CAV (2014)
Rodica Bozianu, Catalin Dima, Emmanuel Filiot
Safraless Synthesis for Epistemic Temporal Specifications. CoRR (2014)
Marie-Pierre Béal, Michel Blockelet, Catalin Dima
Finite-type-Dyck shift spaces. CoRR (2013)
Marie-Pierre Béal, Michel Blockelet, Catalin Dima
Sofic-Dyck shifts. CoRR (2013)
Rodica Bozianu, Catalin Dima, Constantin Enea
Model checking an Epistemic mu-calculus with Synchronous and Perfect Recall Semantics. TARK (2013)
Dimitris Vekris, Frédéric Lang, Catalin Dima, Radu Mateescu
Specifications Using CADP. IFM (2013)
Rodica Bozianu, Catalin Dima, Constantin Enea
Model Checking an Epistemic mu-calculus with Synchronous and Perfect Recall Semantics. CoRR (2013)
Dimitris Vekris, Catalin Dima
Efficient Operational Semantics for for Verification of Temporal Properties. FSEN (2013)
Catalin Dima, Ruggero Lanotte
A study on shuffle, stopwatches and independently evolving clocks. Distributed Comput. 25 (1) (2012)
Raluca Diaconu, Catalin Dima
Model-Checking Alternating-Time Temporal Logic with Strategies Based on Common Knowledge is Undecidable. Appl. Artif. Intell. 26 (4) (2012)
Rodica Bozianu, Catalin Dima, Constantin Enea
Model-checking an Epistemic μ-calculus with Synchronous and Perfect Recall Semantics CoRR (2012)
Dimitar P. Guelev, Catalin Dima
Epistemic ATL with Perfect Recall, Past and Strategy Contexts. CLIMA (2012)
Dimitar P. Guelev, Catalin Dima, Constantin Enea
An alternating-time temporal logic with knowledge, perfect recall and past: axiomatisation and model-checking. J. Appl. Non Class. Logics 21 (1) (2011)
Catalin Dima
Non-axiomatizability for the linear temporal logic of knowledge with concrete observability. J. Log. Comput. 21 (6) (2011)
Catalin Dima, Ferucio Laurentiu Tiplea
Model-checking ATL under Imperfect Information and Perfect Recall Semantics is Undecidable CoRR (2011)
Catalin Dima, Constantin Enea, Dimitar P. Guelev
Model-Checking an Alternating-time Temporal Logic with Knowledge, Imperfect Information, Perfect Recall and Communicating Coalitions GANDALF (2010)
Eugene Asarin, Catalin Dima
On the computation of covert channel capacity. RAIRO Theor. Informatics Appl. 44 (1) (2010)
Catalin Dima, Ruggero Lanotte
Removing All Silent Transitions from Timed Automata. FORMATS (2009)
Catalin Dima
Positive and Negative Results on the Decidability of the Model-Checking Problem for an Epistemic Extension of Timed CTL. TIME (2009)
Dimitar P. Guelev, Catalin Dima
Model-Checking Strategic Ability and Knowledge of the Past of Communicating Coalitions. DALT (2008)
Catalin Dima
Revisiting Satisfiability and Model-Checking for CTLK with Synchrony and Perfect Recall. CLIMA (2008)
Catalin Dima, Marius Minea, Ferucio Laurentiu Tiplea
Preface. Electron. Notes Theor. Comput. Sci. 186 (2007)
Catalin Dima, Constantin Enea, Radu Gramatovici, Alexandru Sofronia
Strategy-Based and Knowledge-Based Models of Information Flow: Equivalence and Decidability. SYNASC (2007)
Catalin Dima
Dynamical Properties of Timed Automata Revisited. FORMATS (2007)
Constantin Enea, Catalin Dima
Abstractions of Multi-agent Systems. CEEMAS (2007)
Catalin Dima, Ruggero Lanotte
Distributed Time-Asynchronous Automata. ICTAC (2007)
Catalin Dima
A Class of Automata for Computing Reachability Relations in Timed Systems. VISSAS (2005)
Catalin Dima
Timed Shuffle Expressions. CONCUR (2005)
Catalin Dima, Alain Girault, Yves Sorel
Static Fault-Tolerant Real-Time Scheduling with "Pseudo-topological" Orders. FORMATS/FTRTFT (2004)
Catalin Dima
A Nonarchimedian Discretization for Timed Languages. FORMATS (2003)
Catalin Dima
Distributed Real-Time Automata. Grammars and Automata for String Processing (2003)
Catalin Dima
Regular Expressions with Timed Dominoes. DMTCS (2003)
Catalin Dima
Computing Reachability Relations in Timed Automata. LICS (2002)
Eugene Asarin, Catalin Dima
Balanced timed regular expressions. Electron. Notes Theor. Comput. Sci. 68 (5) (2002)
Catalin Dima, Alain Girault, Christophe Lavarenne, Yves Sorel
Off-Line Real-Time Fault-Tolerant Scheduling. PDP (2001)
Catalin Dima
Real-Time Automata. J. Autom. Lang. Comb. 6 (1) (2001)
Catalin Dima
Real-Time Automata and the Kleene Algebra of Sets of Real Numbers. STACS (2000)
Catalin Dima
Kleene Theorems for Event-Clock Automata. FCT (1999)

Catalin Dima.css-eqlu8i{font-size:small;padding-left:4px;}

Publication Activity (10 Years)

Top Topics

Top Venues

Catalin Dima