default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDCatalin Dima
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[c44]Benoît Barbot, Damien Busatto-Gaston, Catalin Dima, Youssouf Oualhadj:
Controller Synthesis in Timed Büchi Automata: Robustness and Punctual Guards. QEST+FORMATS 2024: 268-283- [c43]Eugene Asarin
, Aldric Degorre, Catalin Dima, Bernardo Jacobo Inclán:
Computing the Bandwidth of Meager Timed Automata. CIAA 2024: 19-34 - [i17]Benoît Barbot, Damien Busatto-Gaston, Catalin Dima, Youssouf Oualhadj:
Controller Synthesis in Timed Büchi Automata: Robustness and Punctual Guards. CoRR abs/2404.18584 (2024) - [i16]Eugene Asarin, Aldric Degorre, Catalin Dima, Bernardo Jacobo Inclán:
Computing the Bandwidth of Meager Timed Automata. CoRR abs/2406.12694 (2024) - [i15]Catalin Dima, Mariem Hammami, Youssouf Oualhadj, Régine Laleau:
Deciding the synthesis problem for hybrid games through bisimulation. CoRR abs/2409.05498 (2024) - 2023
- [c42]Rodica Condurache, Catalin Dima, Youssouf Oualhadj, Nicolas Troquard:
Synthesis of Resource-Aware Controllers Against Rational Agents. AAMAS 2023: 775-783 - [c41]Catalin Dima, Wojciech Jamroga:
Computationally Feasible Strategies. AAMAS 2023: 784-792 - [c40]Romain Demangeon, Catalin Dima, Daniele Varacca:
Observational Preorders for Alternating Transition Systems. EUMAS 2023: 312-327 - [c39]Eugene Asarin, Aldric Degorre, Catalin Dima, Bernardo Jacobo Inclán:
Bandwidth of Timed Automata: 3 Classes. FSTTCS 2023: 10:1-10:17 - [i14]Eugene Asarin, Aldric Degorre, Catalin Dima, Bernardo Jacobo Inclán:
Bandwidth of Timed Automata: 3 Classes. CoRR abs/2310.01941 (2023) - [i13]Catalin Dima, Wojciech Jamroga:
Computationally Feasible Strategies. CoRR abs/2310.17234 (2023) - 2022
- [c38]Rodica Condurache, Catalin Dima, Madalina Jitaru, Youssouf Oualhadj, Nicolas Troquard:
Careful Autonomous Agents in Environments With Multiple Common Resources. AREA@IJCAI-ECAI 2022: 3-14 - [i12]Francesco Belardinelli, Rodica Condurache, Catalin Dima, Wojciech Jamroga, Michal Knapik:
Bisimulations for Verifying Strategic Abilities with an Application to the ThreeBallot Voting Protocol. CoRR abs/2203.13692 (2022) - [i11]Francesco Belardinelli, Ioana Boureanu, Catalin Dima, Vadim Malvone:
Model Checking Strategic Abilities in Information-sharing Systems. CoRR abs/2204.08896 (2022) - 2021
- [j11]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: 104552 (2021) - [c37]Rodica Condurache, Catalin Dima, Youssouf Oualhadj, Nicolas Troquard:
Rational Synthesis in the Commons with Careless and Careful Agents. AAMAS 2021: 368-376 - [e2]Catalin Dima, Mahsa Shirmohammadi:
Formal Modeling and Analysis of Timed Systems - 19th International Conference, FORMATS 2021, Paris, France, August 24-26, 2021, Proceedings. Lecture Notes in Computer Science 12860, Springer 2021, ISBN 978-3-030-85036-4 [contents] - 2020
- [c36]Francesco Belardinelli, Catalin Dima, Vadim Malvone, Ferucio Laurentiu Tiplea:
A Hennessy-Milner Theorem for ATL with Imperfect Information. LICS 2020: 181-194 - [i10]Francesco Belardinelli, Catalin Dima, Vadim Malvone, Ferucio Laurentiu Tiplea:
A Hennessy-Milner Theorem for ATL with Imperfect Information. CoRR abs/2006.15000 (2020)
2010 – 2019
- 2019
- [c35]Francesco Belardinelli, Ioana Boureanu, Catalin Dima, Vadim Malvone:
Verifying Strategic Abilities in Multi-agent Systems with Private Data-Sharing. AAMAS 2019: 1820-1822 - [i9]Francesco Belardinelli, Catalin Dima, Ioana Boureanu, Vadim Malvone:
Model Checking ATL* on vCGS. CoRR abs/1903.04350 (2019) - 2018
- [j10]Catalin Dima, Bastien Maubert, Sophie Pinchinat:
Relating Paths in Transition Systems: The Fall of the Modal Mu-Calculus. ACM Trans. Comput. Log. 19(3): 23:1-23:33 (2018) - [c34]Francesco Belardinelli, Catalin Dima, Aniello Murano:
Bisimulations for Logics of Strategies: A Study in Expressiveness and Verification. KR 2018: 425-434 - 2017
- [c33]Francesco Belardinelli, Rodica Condurache, Catalin Dima, Wojciech Jamroga, Andrew V. Jones:
Bisimulations for Verifying Strategic Abilities with an Application to ThreeBallot. AAMAS 2017: 1286-1295 - 2016
- [j9]Dimitris Vekris, Frédéric Lang, Catalin Dima, Radu Mateescu:
Verification of EB3 specifications using CADP. Formal Aspects Comput. 28(1): 145-178 (2016) - [j8]Marie-Pierre Béal, Michel Blockelet, Catalin Dima:
Sofic-Dyck shifts. Theor. Comput. Sci. 609: 226-244 (2016) - [c32]Catalin Dima, Bastien Maubert, Sophie Pinchinat:
Relating Paths in Transition Systems: the Fall of the Modal mu-Calculus. ICTCS 2016: 240-244 - [c31]Eugene Asarin, Julien Cervelle, Aldric Degorre, Catalin Dima, Florian Horn, Victor S. Kozyakin:
Entropy Games and Matrix Multiplication Games. STACS 2016: 11:1-11:14 - 2015
- [c30]Catalin Dima, Bastien Maubert, Sophie Pinchinat:
Relating Paths in Transition Systems: The Fall of the Modal Mu-Calculus. MFCS (1) 2015: 179-191 - [i8]Eugene Asarin, Julien Cervelle, Aldric Degorre, Catalin Dima, Florian Horn, Victor S. Kozyakin:
Entropy Games. CoRR abs/1506.04885 (2015) - 2014
- [j7]Catalin Dima:
A Nonarchimedian Discretization for Timed Languages. Fundam. Informaticae 131(3-4): 389-407 (2014) - [c29]Rodica Bozianu, Catalin Dima, Emmanuel Filiot:
Safraless Synthesis for Epistemic Temporal Specifications. CAV 2014: 441-456 - [c28]Eugene Asarin, Michel Blockelet, Aldric Degorre, Catalin Dima, Chunyan Mu:
Asymptotic behaviour in temporal logic. CSL-LICS 2014: 10:1-10:9 - [c27]Marie-Pierre Béal, Michel Blockelet, Catalin Dima:
Zeta functions of finite-type-Dyck shifts are N-algebraic. ITA 2014: 1-8 - [c26]Marie-Pierre Béal, Michel Blockelet, Catalin Dima:
Sofic-Dyck Shifts. MFCS (1) 2014: 63-74 - [i7]Rodica Bozianu, Catalin Dima, Emmanuel Filiot:
Safraless Synthesis for Epistemic Temporal Specifications. CoRR abs/1405.0424 (2014) - [i6]Catalin Dima, Bastien Maubert, Sophie Pinchinat:
The Expressive Power of Epistemic $μ$-Calculus. CoRR abs/1407.5166 (2014) - 2013
- [c25]Dimitris Vekris, Catalin Dima:
Efficient Operational Semantics for for Verification of Temporal Properties. FSEN 2013: 133-149 - [c24]Dimitris Vekris, Frédéric Lang, Catalin Dima, Radu Mateescu:
Verification of EB3 Specifications Using CADP. IFM 2013: 61-76 - [c23]Rodica Bozianu, Catalin Dima, Constantin Enea:
Model checking an Epistemic mu-calculus with Synchronous and Perfect Recall Semantics. TARK 2013 - [i5]Marie-Pierre Béal, Michel Blockelet, Catalin Dima:
Sofic-Dyck shifts. CoRR abs/1305.7413 (2013) - [i4]Rodica Bozianu, Catalin Dima, Constantin Enea:
Model Checking an Epistemic mu-calculus with Synchronous and Perfect Recall Semantics. CoRR abs/1310.6434 (2013) - [i3]Marie-Pierre Béal, Michel Blockelet, Catalin Dima:
Finite-type-Dyck shift spaces. CoRR abs/1311.4223 (2013) - 2012
- [j6]Raluca Diaconu, Catalin Dima:
Model-Checking Alternating-Time Temporal Logic with Strategies Based on Common Knowledge is Undecidable. Appl. Artif. Intell. 26(4): 331-348 (2012) - [j5]Catalin Dima, Ruggero Lanotte:
A study on shuffle, stopwatches and independently evolving clocks. Distributed Comput. 25(1): 5-33 (2012) - [c22]Dimitar P. Guelev, Catalin Dima:
Epistemic ATL with Perfect Recall, Past and Strategy Contexts. CLIMA 2012: 77-93 - [i2]Rodica Bozianu, Catalin Dima, Constantin Enea:
Model-checking an Epistemic μ-calculus with Synchronous and Perfect Recall Semantics. CoRR abs/1204.2087 (2012) - 2011
- [j4]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): 93-131 (2011) - [j3]Catalin Dima:
Non-axiomatizability for the linear temporal logic of knowledge with concrete observability. J. Log. Comput. 21(6): 939-958 (2011) - [i1]Catalin Dima, Ferucio Laurentiu Tiplea:
Model-checking ATL under Imperfect Information and Perfect Recall Semantics is Undecidable. CoRR abs/1102.4225 (2011) - 2010
- [j2]Eugene Asarin, Catalin Dima:
On the computation of covert channel capacity. RAIRO Theor. Informatics Appl. 44(1): 37-58 (2010) - [c21]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: 103-117
2000 – 2009
- 2009
- [c20]Catalin Dima, Ruggero Lanotte:
Removing All Silent Transitions from Timed Automata. FORMATS 2009: 118-132 - [c19]Catalin Dima:
Positive and Negative Results on the Decidability of the Model-Checking Problem for an Epistemic Extension of Timed CTL. TIME 2009: 29-36 - 2008
- [c18]Catalin Dima:
Revisiting Satisfiability and Model-Checking for CTLK with Synchrony and Perfect Recall. CLIMA 2008: 117-131 - [c17]Dimitar P. Guelev, Catalin Dima:
Model-Checking Strategic Ability and Knowledge of the Past of Communicating Coalitions. DALT 2008: 75-90 - 2007
- [c16]Constantin Enea, Catalin Dima:
Abstractions of Multi-agent Systems. CEEMAS 2007: 11-21 - [c15]Catalin Dima:
Dynamical Properties of Timed Automata Revisited. FORMATS 2007: 130-146 - [c14]Catalin Dima, Ruggero Lanotte:
Distributed Time-Asynchronous Automata. ICTAC 2007: 185-200 - [c13]Catalin Dima, Constantin Enea, Radu Gramatovici, Alexandru Sofronia:
Strategy-Based and Knowledge-Based Models of Information Flow: Equivalence and Decidability. SYNASC 2007: 33-40 - [e1]Catalin Dima, Marius Minea, Ferucio Laurentiu Tiplea:
Proceedings of the First Workshop in Information and Computer Security, ICS@SYNASC 2006, Timisoara, Romania, September 30, 2006. Electronic Notes in Theoretical Computer Science 186, Elsevier 2007 [contents] - 2006
- [c12]Catalin Dima, Marius Minea, Ferucio Laurentiu Tiplea:
Preface. ICS@SYNASC 2006: 1-2 - 2005
- [c11]Catalin Dima:
Timed Shuffle Expressions. CONCUR 2005: 95-109 - [c10]Catalin Dima:
A Class of Automata for Computing Reachability Relations in Timed Systems. VISSAS 2005: 69-89 - 2004
- [c9]Catalin Dima, Alain Girault, Yves Sorel:
Static Fault-Tolerant Real-Time Scheduling with "Pseudo-topological" Orders. FORMATS/FTRTFT 2004: 215-230 - 2003
- [c8]Catalin Dima:
Distributed Real-Time Automata. Grammars and Automata for String Processing 2003: 131-140 - [c7]Catalin Dima:
Regular Expressions with Timed Dominoes. DMTCS 2003: 141-154 - [c6]Catalin Dima:
A Nonarchimedian Discretization for Timed Languages. FORMATS 2003: 168-181 - 2002
- [c5]Catalin Dima:
Computing Reachability Relations in Timed Automata. LICS 2002: 177- - [c4]Eugene Asarin, Catalin Dima:
Balanced timed regular expressions. MTCS 2002: 16-33 - 2001
- [b1]Catalin Dima:
An algebraic theory of real-time formal languages. (Théorie algébrique des langages formels temps réel). Joseph Fourier University, Grenoble, France, 2001 - [j1]Catalin Dima:
Real-Time Automata. J. Autom. Lang. Comb. 6(1): 3-23 (2001) - [c3]Catalin Dima, Alain Girault, Christophe Lavarenne, Yves Sorel:
Off-Line Real-Time Fault-Tolerant Scheduling. PDP 2001: 410-417 - 2000
- [c2]Catalin Dima:
Real-Time Automata and the Kleene Algebra of Sets of Real Numbers. STACS 2000: 279-289
1990 – 1999
- 1999
- [c1]Catalin Dima:
Kleene Theorems for Event-Clock Automata. FCT 1999: 215-225
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-10 21:18 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
