Catalin Dima - RankMe

83 papers A* 4A 7B 5C 7Misc 2Journal 31Unranked 24

Year	Rank	Type	Title / Venue / Authors
2026	B	`ed.`	PRIMA 2025: Principles and Practice of Multi-Agent Systems - 26th International Conference, Modena, Italy, December 16-19, 2025, Proceedings PRIMA Catalin Dima, Angelo Ferrando, Vadim Malvone
2025	—	`conf`	Bridging Threat Models and Detections: Formal Verification via CADP. FROM Dumitru-Bogdan Prelipcean, Catalin Dima
2025	J	`jnl`	Controller synthesis in timed Büchi automata: Robustness and punctual guards. Perform. Evaluation Benoît Barbot, Damien Busatto-Gaston, Catalin Dima, Youssouf Oualhadj
2025	C	`conf`	Formal Construction of Threat Detections from Attack Trees. ICFEM Dumitru-Bogdan Prelipcean, Catalin Dima, Daniele Varacca
2025	J	`jnl`	Model-checking Strategic Abilities in Information-sharing Systems. ACM Trans. Comput. Log. Francesco Belardinelli, Ioana Boureanu, Catalin Dima, Vadim Malvone
2025	—	`conf`	Weighing Obese Timed Languages. RP Eugene Asarin, Aldric Degorre, Catalin Dima, Bernardo Jacobo Inclán
2025	J	`jnl`	Weighing Obese Timed Languages. CoRR Eugene Asarin, Aldric Degorre, Catalin Dima, Bernardo Jacobo Inclán
2024	C	`conf`	Computing the Bandwidth of Meager Timed Automata. CIAA Eugene Asarin, Aldric Degorre, Catalin Dima, Bernardo Jacobo Inclán
2024	J	`jnl`	Computing the Bandwidth of Meager Timed Automata. CoRR Eugene Asarin, Aldric Degorre, Catalin Dima, Bernardo Jacobo Inclán
2024	—	`conf`	Controller Synthesis in Timed Büchi Automata: Robustness and Punctual Guards. QEST+FORMATS Benoît Barbot, Damien Busatto-Gaston, Catalin Dima, Youssouf Oualhadj
2024	J	`jnl`	Controller Synthesis in Timed Büchi Automata: Robustness and Punctual Guards. CoRR Benoît Barbot, Damien Busatto-Gaston, Catalin Dima, Youssouf Oualhadj
2024	C	`conf`	Deciding the Synthesis Problem for Hybrid Games Through Bisimulation. ICFEM Catalin Dima, Mariem Hammami, Youssouf Oualhadj, Régine Laleau
2024	J	`jnl`	Deciding the synthesis problem for hybrid games through bisimulation. CoRR Catalin Dima, Mariem Hammami, Youssouf Oualhadj, Régine Laleau
2023	—	`conf`	Bandwidth of Timed Automata: 3 Classes. FSTTCS Eugene Asarin, Aldric Degorre, Catalin Dima, Bernardo Jacobo Inclán
2023	J	`jnl`	Bandwidth of Timed Automata: 3 Classes. CoRR Eugene Asarin, Aldric Degorre, Catalin Dima, Bernardo Jacobo Inclán
2023	A	`conf`	Computationally Feasible Strategies. AAMAS Catalin Dima, Wojciech Jamroga
2023	J	`jnl`	Computationally Feasible Strategies. CoRR Catalin Dima, Wojciech Jamroga
2023	C	`conf`	Observational Preorders for Alternating Transition Systems. EUMAS Romain Demangeon, Catalin Dima, Daniele Varacca
2023	A	`conf`	Synthesis of Resource-Aware Controllers Against Rational Agents. AAMAS Rodica Condurache, Catalin Dima, Youssouf Oualhadj, Nicolas Troquard
2022	J	`jnl`	Bisimulations for Verifying Strategic Abilities with an Application to the ThreeBallot Voting Protocol. CoRR Francesco Belardinelli, Rodica Condurache, Catalin Dima, Wojciech Jamroga, Michal Knapik
2022	—	`conf`	Careful Autonomous Agents in Environments With Multiple Common Resources. AREA@IJCAI-ECAI Rodica Condurache, Catalin Dima, Madalina Jitaru, Youssouf Oualhadj, Nicolas Troquard
2022	J	`jnl`	Model Checking Strategic Abilities in Information-sharing Systems. CoRR Francesco Belardinelli, Ioana Boureanu, Catalin Dima, Vadim Malvone
2021	J	`jnl`	Bisimulations for verifying strategic abilities with an application to the ThreeBallot voting protocol. Inf. Comput. Francesco Belardinelli, Rodica Condurache, Catalin Dima, Wojciech Jamroga, Michal Knapik
2021	—	`ed.`	Formal Modeling and Analysis of Timed Systems - 19th International Conference, FORMATS 2021, Paris, France, August 24-26, 2021, Proceedings FORMATS Catalin Dima, Mahsa Shirmohammadi
2021	A	`conf`	Rational Synthesis in the Commons with Careless and Careful Agents. AAMAS Rodica Condurache, Catalin Dima, Youssouf Oualhadj, Nicolas Troquard
2020	A*	`conf`	A Hennessy-Milner Theorem for ATL with Imperfect Information. LICS Francesco Belardinelli, Catalin Dima, Vadim Malvone, Ferucio Laurentiu Tiplea
2020	J	`jnl`	A Hennessy-Milner Theorem for ATL with Imperfect Information. CoRR Francesco Belardinelli, Catalin Dima, Vadim Malvone, Ferucio Laurentiu Tiplea
2019	J	`jnl`	Model Checking ATL* on vCGS. CoRR Francesco Belardinelli, Catalin Dima, Ioana Boureanu, Vadim Malvone
2019	A	`conf`	Verifying Strategic Abilities in Multi-agent Systems with Private Data-Sharing. AAMAS Francesco Belardinelli, Ioana Boureanu, Catalin Dima, Vadim Malvone
2018	A*	`conf`	Bisimulations for Logics of Strategies: A Study in Expressiveness and Verification. KR Francesco Belardinelli, Catalin Dima, Aniello Murano
2018	J	`jnl`	Relating Paths in Transition Systems: The Fall of the Modal Mu-Calculus. ACM Trans. Comput. Log. Catalin Dima, Bastien Maubert, Sophie Pinchinat
2017	A	`conf`	Bisimulations for Verifying Strategic Abilities with an Application to ThreeBallot. AAMAS Francesco Belardinelli, Rodica Condurache, Catalin Dima, Wojciech Jamroga, Andrew V. Jones
2016	A	`conf`	Entropy Games and Matrix Multiplication Games. STACS Eugene Asarin, Julien Cervelle, Aldric Degorre, Catalin Dima, Florian Horn, Victor S. Kozyakin
2016	—	`conf`	Relating Paths in Transition Systems: the Fall of the Modal mu-Calculus. ICTCS Catalin Dima, Bastien Maubert, Sophie Pinchinat
2016	J	`jnl`	Sofic-Dyck shifts. Theor. Comput. Sci. Marie-Pierre Béal, Michel Blockelet, Catalin Dima
2016	J	`jnl`	Verification of EB Formal Aspects Comput. Dimitris Vekris, Frédéric Lang, Catalin Dima, Radu Mateescu
2015	J	`jnl`	Entropy Games. CoRR Eugene Asarin, Julien Cervelle, Aldric Degorre, Catalin Dima, Florian Horn, Victor S. Kozyakin
2015	—	`conf`	Relating Paths in Transition Systems: The Fall of the Modal Mu-Calculus. MFCS (1) Catalin Dima, Bastien Maubert, Sophie Pinchinat
2014	J	`jnl`	A Nonarchimedian Discretization for Timed Languages. Fundam. Informaticae Catalin Dima
2014	—	`conf`	Asymptotic behaviour in temporal logic. CSL-LICS Eugene Asarin, Michel Blockelet, Aldric Degorre, Catalin Dima, Chunyan Mu
2014	A*	`conf`	Safraless Synthesis for Epistemic Temporal Specifications. CAV Rodica Bozianu, Catalin Dima, Emmanuel Filiot
2014	J	`jnl`	Safraless Synthesis for Epistemic Temporal Specifications. CoRR Rodica Bozianu, Catalin Dima, Emmanuel Filiot
2014	—	`conf`	Sofic-Dyck Shifts. MFCS (1) Marie-Pierre Béal, Michel Blockelet, Catalin Dima
2014	J	`jnl`	The Expressive Power of Epistemic $μ$-Calculus. CoRR Catalin Dima, Bastien Maubert, Sophie Pinchinat
2014	Misc	`conf`	Zeta functions of finite-type-Dyck shifts are N-algebraic. ITA Marie-Pierre Béal, Michel Blockelet, Catalin Dima
2013	—	`conf`	Efficient Operational Semantics for for Verification of Temporal Properties. FSEN Dimitris Vekris, Catalin Dima
2013	J	`jnl`	Finite-type-Dyck shift spaces. CoRR Marie-Pierre Béal, Michel Blockelet, Catalin Dima
2013	J	`jnl`	Model Checking an Epistemic mu-calculus with Synchronous and Perfect Recall Semantics. CoRR Rodica Bozianu, Catalin Dima, Constantin Enea
2013	B	`conf`	Model checking an Epistemic mu-calculus with Synchronous and Perfect Recall Semantics. TARK Rodica Bozianu, Catalin Dima, Constantin Enea
2013	J	`jnl`	Sofic-Dyck shifts. CoRR Marie-Pierre Béal, Michel Blockelet, Catalin Dima
2013	B	`conf`	Verification of EB IFM Dimitris Vekris, Frédéric Lang, Catalin Dima, Radu Mateescu
2012	J	`jnl`	A study on shuffle, stopwatches and independently evolving clocks. Distributed Comput. Catalin Dima, Ruggero Lanotte
2012	—	`conf`	Epistemic ATL with Perfect Recall, Past and Strategy Contexts. CLIMA Dimitar P. Guelev, Catalin Dima
2012	J	`jnl`	Model-Checking Alternating-Time Temporal Logic with Strategies Based on Common Knowledge is Undecidable. Appl. Artif. Intell. Raluca Diaconu, Catalin Dima
2012	J	`jnl`	Model-checking an Epistemic μ-calculus with Synchronous and Perfect Recall Semantics CoRR Rodica Bozianu, Catalin Dima, Constantin Enea
2011	J	`jnl`	An alternating-time temporal logic with knowledge, perfect recall and past: axiomatisation and model-checking. J. Appl. Non Class. Logics Dimitar P. Guelev, Catalin Dima, Constantin Enea
2011	J	`jnl`	Model-checking ATL under Imperfect Information and Perfect Recall Semantics is Undecidable CoRR Catalin Dima, Ferucio Laurentiu Tiplea
2011	J	`jnl`	Non-axiomatizability for the linear temporal logic of knowledge with concrete observability. J. Log. Comput. Catalin Dima
2010	—	`conf`	Model-Checking an Alternating-time Temporal Logic with Knowledge, Imperfect Information, Perfect Recall and Communicating Coalitions GANDALF Catalin Dima, Constantin Enea, Dimitar P. Guelev
2010	J	`jnl`	On the computation of covert channel capacity. RAIRO Theor. Informatics Appl. Eugene Asarin, Catalin Dima
2009	C	`conf`	Positive and Negative Results on the Decidability of the Model-Checking Problem for an Epistemic Extension of Timed CTL. TIME Catalin Dima
2009	—	`conf`	Removing All Silent Transitions from Timed Automata. FORMATS Catalin Dima, Ruggero Lanotte
2008	—	`conf`	Model-Checking Strategic Ability and Knowledge of the Past of Communicating Coalitions. DALT Dimitar P. Guelev, Catalin Dima
2008	—	`conf`	Revisiting Satisfiability and Model-Checking for CTLK with Synchrony and Perfect Recall. CLIMA Catalin Dima
2007	—	`conf`	Abstractions of Multi-agent Systems. CEEMAS Constantin Enea, Catalin Dima
2007	C	`conf`	Distributed Time-Asynchronous Automata. ICTAC Catalin Dima, Ruggero Lanotte
2007	—	`conf`	Dynamical Properties of Timed Automata Revisited. FORMATS Catalin Dima
2007	—	`ed.`	Proceedings of the First Workshop in Information and Computer Security, ICS@SYNASC 2006, Timisoara, Romania, September 30, 2006 ICS@SYNASC Catalin Dima, Marius Minea, Ferucio Laurentiu Tiplea
2007	Misc	`conf`	Strategy-Based and Knowledge-Based Models of Information Flow: Equivalence and Decidability. SYNASC Catalin Dima, Constantin Enea, Radu Gramatovici, Alexandru Sofronia
2006	—	`conf`	Preface. ICS@SYNASC Catalin Dima, Marius Minea, Ferucio Laurentiu Tiplea
2005	—	`conf`	A Class of Automata for Computing Reachability Relations in Timed Systems. VISSAS Catalin Dima
2005	B	`conf`	Timed Shuffle Expressions. CONCUR Catalin Dima
2004	—	`conf`	Static Fault-Tolerant Real-Time Scheduling with "Pseudo-topological" Orders. FORMATS/FTRTFT Catalin Dima, Alain Girault, Yves Sorel
2003	—	`conf`	A Nonarchimedian Discretization for Timed Languages. FORMATS Catalin Dima
2003	—	`conf`	Distributed Real-Time Automata. Grammars and Automata for String Processing Catalin Dima
2003	—	`conf`	Regular Expressions with Timed Dominoes. DMTCS Catalin Dima
2002	—	`conf`	Balanced timed regular expressions. MTCS Eugene Asarin, Catalin Dima
2002	A*	`conf`	Computing Reachability Relations in Timed Automata. LICS Catalin Dima
2001	—	`—`	An algebraic theory of real-time formal languages. (Théorie algébrique des langages formels temps réel). Catalin Dima
2001	C	`conf`	Off-Line Real-Time Fault-Tolerant Scheduling. PDP Catalin Dima, Alain Girault, Christophe Lavarenne, Yves Sorel
2001	J	`jnl`	Real-Time Automata. J. Autom. Lang. Comb. Catalin Dima
2000	A	`conf`	Real-Time Automata and the Kleene Algebra of Sets of Real Numbers. STACS Catalin Dima
1999	B	`conf`	Kleene Theorems for Event-Clock Automata. FCT Catalin Dima