On models of real-time systems:
C. Dima and Ruggero Lanotte, A study on shuffle, stopwatches and independently evolving clocks, to appear in Distributed Computing.
C. Dima and Ruggero Lanotte, Removing all silent transitions from timed automata, in Proceedings of FORMATS 2009. A technical report is also available, with some extra proofs.
C. Dima, A class of automata for computing reachability relations in timed systems , in Proceedings of VISSAS 2005.
C. Dima, On an algebraic definition of timed regular languages , in Proceedings of CAVIS 2004.
C. Dima, A nonarchimedian discretization of timed languages , in Proceedings of FORMATS 2003.
Eugene Asarin and C. Dima, Balanced timed regular expressions, in Proceedings of MTCS 2002, Electronic Notes in Theoretical Computer Science, vol. 68(5), 2002.
C. Dima, Computing reachability relations in timed automata , in Proceedings of LICS'02.
C. Dima, Real-time automata and the Kleene algebra of sets of real numbers in Proceedings of STACS'2000.
Dimitar Guelev, C. Dima and Constantin Enea, An alternating-time temporal logic with knowledge, perfect recall and past: axiomatisation and model-checking , in Journal of Applied Non-Classical Logics.
C. Dima and Raluca Diaconu, Model-Checking Alternating-time Temporal Logic with Strategies Based on Common Knowledge Is Undecidable , to appear in Applied Artificial Intelligence.
C. Dima and Ferucio Tiplea, Model-checking ATL under Imperfect Information and Perfect Recall Semantics is Undecidable , Submitted.
C. Dima, Constantin Enea and Dimitar Guelev, Model-Checking an Alternating-time Temporal Logic with Knowledge, Imperfect Information, Perfect Recall and Communicating Coalitions , Proceedings of GandALF 2010.
C. Dima, Positive and negative results on the decidability of the model-checking problem for an epistemic extension of Timed CTL, Proceedings of TIME 2009 A technical report is also available, with some extra proofs.
C. Dima, Revisiting satisfiability and model-checking for CTLK with synchrony and perfect recall, Proceedings of CLIMA 2008
Dimitar Guelev and C. Dima, Model-checking strategic ability and knowledge of the past of communicating coalitions, Proceedings of DALT 2008.
C. Dima and Constantin Enea, Nondeduciblity on strategies in the temporal logic of knowledge, in Proceedings of WITS 2007.
C. Dima, Constantin Enea, Radu Gramatovici and Alexandru Sofronia, Strategy-based and knowledge-based models of information flow: equivalence and decidability, in Proceedings of SYNASC 2007.
C. Dima, Alain Girault and Yves Sorel, Static fault-tolerant real-time scheduling with "pseudo-topological" orderings , in Proceedings of FORMATS/FTRTFT 2004 .
C. Dima, Marius Minea and Ferucio Tiplea (editors), Electronic Notes in Theoretical Computer Science vol. 186 : Proceedings of the Workshop in Computer and Information Security, affiliated with SYNASC 2006.
Last modified on Nov. 2nd, 2011.