Catalin Dima

	2012
28		Rodica Bozianu, Catalin Dima, Constantin Enea: Model-checking an Epistemic μ-calculus with Synchronous and Perfect Recall Semantics CoRR abs/1204.2087: (2012)
27		Catalin Dima, Ruggero Lanotte: A study on shuffle, stopwatches and independently evolving clocks. Distributed Computing 25(1): 5-33 (2012)
	2011
26		Catalin Dima, Ferucio Laurentiu Tiplea: Model-checking ATL under Imperfect Information and Perfect Recall Semantics is Undecidable CoRR abs/1102.4225: (2011)
25		Catalin Dima: Non-axiomatizability for the linear temporal logic of knowledge with concrete observability. J. Log. Comput. 21(6): 939-958 (2011)
24		Dimitar P. Guelev, Catalin Dima, Constantin Enea: An alternating-time temporal logic with knowledge, perfect recall and past: axiomatisation and model-checking. Journal of Applied Non-Classical Logics 21(1): 93-131 (2011)
	2010
23		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
22		Eugene Asarin, Catalin Dima: On the computation of covert channel capacity. RAIRO - Theor. Inf. and Applic. 44(1): 37-58 (2010)
	2009
21		Catalin Dima, Ruggero Lanotte: Removing All Silent Transitions from Timed Automata. FORMATS 2009: 118-132
20		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
19		Catalin Dima: Revisiting Satisfiability and Model-Checking for CTLK with Synchrony and Perfect Recall. CLIMA 2008: 117-131
18		Dimitar P. Guelev, Catalin Dima: Model-Checking Strategic Ability and Knowledge of the Past of Communicating Coalitions. DALT 2008: 75-90
	2007
17		Constantin Enea, Catalin Dima: Abstractions of Multi-agent Systems. CEEMAS 2007: 11-21
16		Catalin Dima: Dynamical Properties of Timed Automata Revisited. FORMATS 2007: 130-146
15		Catalin Dima, Ruggero Lanotte: Distributed Time-Asynchronous Automata. ICTAC 2007: 185-200
14		Catalin Dima, Constantin Enea, Radu Gramatovici, Alexandru Sofronia: Strategy-Based and Knowledge-Based Models of Information Flow: Equivalence and Decidability. SYNASC 2007: 33-40
13		Catalin Dima, Marius Minea, Ferucio Laurentiu Tiplea: Preface. Electr. Notes Theor. Comput. Sci. 186: 1-2 (2007)
	2005
12		Catalin Dima: Timed Shuffle Expressions. CONCUR 2005: 95-109
11		Catalin Dima: A Class of Automata for Computing Reachability Relations in Timed Systems. VISSAS 2005: 69-89
	2004
10		Catalin Dima, Alain Girault, Yves Sorel: Static Fault-Tolerant Real-Time Scheduling with "Pseudo-topological" Orders. FORMATS/FTRTFT 2004: 215-230
	2003
9		Catalin Dima: Regular Expressions with Timed Dominoes. DMTCS 2003: 141-154
8		Catalin Dima: A Nonarchimedian Discretization for Timed Languages. FORMATS 2003: 168-181
7		Catalin Dima: Distributed Real-Time Automata. Grammars and Automata for String Processing 2003: 131-140
	2002
6		Catalin Dima: Computing Reachability Relations in Timed Automata. LICS 2002: 177-
5		Eugene Asarin, Catalin Dima: Balanced timed regular expressions. Electr. Notes Theor. Comput. Sci. 68(5): 16-33 (2002)
	2001
4		Catalin Dima, Alain Girault, Christophe Lavarenne, Yves Sorel: Off-Line Real-Time Fault-Tolerant Scheduling. PDP 2001: 410-417
3		Catalin Dima: Real-Time Automata. Journal of Automata, Languages and Combinatorics 6(1): 3-24 (2001)
	2000
2		Catalin Dima: Real-Time Automata and the Kleene Algebra of Sets of Real Numbers. STACS 2000: 279-289
	1999
1		Catalin Dima: Kleene Theorems for Event-Clock Automata. FCT 1999: 215-225

Coauthor Index

1	Eugene Asarin	[5] [22]
2	Rodica Bozianu	[28]
3	Constantin Enea	[14] [17] [23] [24] [28]
4	Alain Girault	[4] [10]
5	Radu Gramatovici	[14]
6	Dimitar P. Guelev	[18] [23] [24]
7	Ruggero Lanotte	[15] [21] [27]
8	Christophe Lavarenne	[4]
9	Marius Minea	[13]
10	Alexandru Sofronia	[14]
11	Yves Sorel	[4] [10]
12	Ferucio Laurentiu Tiplea	[13] [26]

Colors in the list of coauthors

Last update Tue May 29 20:41:18 2012 CET by the DBLP Team — Data released under the ODC-BY 1.0 license — See also our legal information page