Catalin Dima

According to our database1, Catalin Dima authored at least 41 papers between 1999 and 2018.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of four.



In proceedings 
PhD thesis 




Bisimulations for Logics of Strategies: A Study in Expressiveness and Verification.
Proceedings of the Principles of Knowledge Representation and Reasoning: Proceedings of the Sixteenth International Conference, 2018

Bisimulations for Verifying Strategic Abilities with an Application to ThreeBallot.
Proceedings of the 16th Conference on Autonomous Agents and MultiAgent Systems, 2017

Entropy Games and Matrix Multiplication Games.
Proceedings of the 33rd Symposium on Theoretical Aspects of Computer Science, 2016

Relating Paths in Transition Systems: the Fall of the Modal mu-Calculus.
Proceedings of the 17th Italian Conference on Theoretical Computer Science, 2016

Relating Paths in Transition Systems: The Fall of the Modal Mu-Calculus.
Proceedings of the Mathematical Foundations of Computer Science 2015, 2015

Sofic-Dyck Shifts.
Proceedings of the Mathematical Foundations of Computer Science 2014, 2014

Zeta functions of finite-type-Dyck shifts are N-algebraic.
Proceedings of the 2014 Information Theory and Applications Workshop, 2014

Asymptotic behaviour in temporal logic.
Proceedings of the Joint Meeting of the Twenty-Third EACSL Annual Conference on Computer Science Logic (CSL) and the Twenty-Ninth Annual ACM/IEEE Symposium on Logic in Computer Science (LICS), 2014

Safraless Synthesis for Epistemic Temporal Specifications.
Proceedings of the Computer Aided Verification - 26th International Conference, 2014

Model checking an Epistemic mu-calculus with Synchronous and Perfect Recall Semantics.
Proceedings of the 14th Conference on Theoretical Aspects of Rationality and Knowledge (TARK 2013), 2013

Verification of EB3 Specifications Using CADP.
Proceedings of the Integrated Formal Methods, 10th International Conference, 2013

Efficient Operational Semantics for for Verification of Temporal Properties.
Proceedings of the Fundamentals of Software Engineering - 5th International Conference, 2013

A study on shuffle, stopwatches and independently evolving clocks.
Distributed Computing, 2012

Model-Checking Alternating-Time Temporal Logic with Strategies Based on Common Knowledge is Undecidable.
Applied Artificial Intelligence, 2012

Epistemic ATL with Perfect Recall, Past and Strategy Contexts.
Proceedings of the Computational Logic in Multi-Agent Systems, 2012

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

An alternating-time temporal logic with knowledge, perfect recall and past: axiomatisation and model-checking.
Journal of Applied Non-Classical Logics, 2011

On the computation of covert channel capacity.
RAIRO - Theor. Inf. and Applic., 2010

Model-Checking an Alternating-time Temporal Logic with Knowledge, Imperfect Information, Perfect Recall and Communicating Coalitions
Proceedings of the Proceedings First Symposium on Games, 2010

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

Removing All Silent Transitions from Timed Automata.
Proceedings of the Formal Modeling and Analysis of Timed Systems, 2009

Model-Checking Strategic Ability and Knowledge of the Past of Communicating Coalitions.
Proceedings of the Declarative Agent Languages and Technologies VI, 2008

Revisiting Satisfiability and Model-Checking for CTLK with Synchrony and Perfect Recall.
Proceedings of the Computational Logic in Multi-Agent Systems, 9th International Workshop, 2008

Electr. Notes Theor. Comput. Sci., 2007

Strategy-Based and Knowledge-Based Models of Information Flow: Equivalence and Decidability.
Proceedings of the Ninth International Symposium on Symbolic and Numeric Algorithms for Scientific Computing, 2007

Distributed Time-Asynchronous Automata.
Proceedings of the Theoretical Aspects of Computing, 2007

Dynamical Properties of Timed Automata Revisited.
Proceedings of the Formal Modeling and Analysis of Timed Systems, 2007

Abstractions of Multi-agent Systems.
Proceedings of the Multi-Agent Systems and Applications V, 2007

A Class of Automata for Computing Reachability Relations in Timed Systems.
Proceedings of the Verification of Infinite-State Systems with Applications to Security, 2005

Timed Shuffle Expressions.
Proceedings of the CONCUR 2005 - Concurrency Theory, 16th International Conference, 2005

Static Fault-Tolerant Real-Time Scheduling with "Pseudo-topological" Orders.
Proceedings of the Formal Techniques, 2004

A Nonarchimedian Discretization for Timed Languages.
Proceedings of the Formal Modeling and Analysis of Timed Systems: First International Workshop, 2003

Regular Expressions with Timed Dominoes.
Proceedings of the Discrete Mathematics and Theoretical Computer Science, 2003

Distributed Real-Time Automata.
Proceedings of the Grammars and Automata for String Processing: From Mathematics and Computer Science to Biology, 2003

Balanced timed regular expressions.
Electr. Notes Theor. Comput. Sci., 2002

Computing Reachability Relations in Timed Automata.
Proceedings of the 17th IEEE Symposium on Logic in Computer Science (LICS 2002), 2002

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

Real-Time Automata.
Journal of Automata, Languages and Combinatorics, 2001

Off-Line Real-Time Fault-Tolerant Scheduling.
Proceedings of the Ninth Euromicro Workshop on Parallel and Distributed Processing, 2001

Real-Time Automata and the Kleene Algebra of Sets of Real Numbers.
Proceedings of the STACS 2000, 2000

Kleene Theorems for Event-Clock Automata.
Proceedings of the Fundamentals of Computation Theory, 12th International Symposium, 1999