A. Carayol and S. Wöhrle, The Caucal Hierarchy of Infinite Graphs in Terms of Logic and Higher-Order Pushdown Automata, FST TCS 2003: Foundations of Software Technology and Theoretical Computer Science, 23rd Conference Proceedings, pp.112-123, 2003.
DOI : 10.1007/978-3-540-24597-1_10

T. Colcombet and C. Löding, Transforming structures by set interpretations, Logical Methods in Computer Science, vol.3, issue.2, 2007.
DOI : 10.2168/LMCS-3(2:4)2007

URL : https://hal.archives-ouvertes.fr/hal-00192051

M. Dauchet and S. Tison, The theory of ground rewrite systems is decidable, [1990] Proceedings. Fifth Annual IEEE Symposium on Logic in Computer Science, pp.242-248, 1990.
DOI : 10.1109/LICS.1990.113750

H. Ebbinghaus, J. Flum, and W. Thomas, Mathematical Logic. Undergraduate Texts in Mathematics, 1996.

B. Hodgson, On direct products of automaton decidable theories, Theoretical Computer Science, vol.19, issue.3, pp.331-335, 1982.
DOI : 10.1016/0304-3975(82)90042-1

K. Lodaya, Petri nets, event structures and algebra. In Formal Models , Languages and Applications [this volume commemorates the 75th birthday of Prof, Rani Siromoney], pp.246-259, 2007.
DOI : 10.1142/9789812773036_0017

C. Löding, Infinite Graphs Generated by Tree Rewriting, 2003.

P. Madhusudan, Model-checking trace event structures, 18th Annual IEEE Symposium of Logic in Computer Science, 2003. Proceedings., pp.22-25, 2003.
DOI : 10.1109/LICS.2003.1210077

URL : http://www-faculty.cs.uiuc.edu/~madhu/lics03.ps

S. Schulz, First-order logic with reachability predicates on infinite systems, IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, FSTTCS 2010, pp.493-504, 2010.

M. Shields, Asynchronous Transition Systems, pp.183-189, 1997.
DOI : 10.1007/978-1-4471-0933-4_15

G. Winskel and M. Nielsen, Handbook of logic in computer science, chapter Models for Concurrency, pp.1-148, 1995.

S. Wöhrle and W. Thomas, Model checking synchronized products of infinite transition systems, Proceedings of the 19th Annual IEEE Symposium on Logic in Computer Science, 2004., pp.14-17, 2004.
DOI : 10.1109/LICS.2004.1319595