P. A. Abdulla, B. Jonsson, M. Nilsson, and M. Saksena, A Survey of Regular Model Checking, Intl. Conf. on Concurrency Theory (CONCUR), pp.35-48, 2004.
DOI : 10.1007/BFb0028736

R. Alur and P. Madhusudan, Visibly pushdown languages, Proceedings of the thirty-sixth annual ACM symposium on Theory of computing , STOC '04, pp.202-211, 2004.
DOI : 10.1145/1007352.1007390
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.116.3757

D. Babi´cbabi´c and Z. Rakamari´crakamari´c, Asynchronously communicating visibly pushdown systems, 2011.

T. Ball, R. Majumdar, T. Millstein, and S. K. Rajamani, Automatic predicate abstraction of C programs, Conf. on Programming Language Design and Implementation (PLDI), pp.203-213, 2001.

S. Basu, T. Bultan, and M. Ouederni, Synchronizability for Verification of Asynchronously Communicating Systems, Intl. Conf. on Verification, Model Checking, and Abstract Interpretation (VMCAI), pp.56-71, 2012.
DOI : 10.1007/978-3-540-78800-3_21

B. Boigelot, P. Godefroid, B. Willems, and P. Wolper, The power of QDDs, Intl. Symp. on Static Analysis (SAS), pp.172-186, 1997.

A. Bouajjani, P. Habermehl, A. Rogalewicz, and T. Vojnar, Abstract Regular Tree Model Checking, Electronic Notes in Theoretical Computer Science, vol.149, issue.1, pp.37-48, 2006.
DOI : 10.1016/j.entcs.2005.11.015
URL : https://hal.archives-ouvertes.fr/hal-00156828

A. Bouajjani, P. Habermehl, and T. Vojnar, Abstract Regular Model Checking, Intl. Conf. on Computer Aided Verification (CAV), pp.372-386, 2004.
DOI : 10.1007/978-3-540-27813-9_29
URL : https://hal.archives-ouvertes.fr/hal-00159512

A. Bouajjani, B. Jonsson, M. Nilsson, and T. Touili, Regular Model Checking, Intl. Conf. on Computer Aided Verification (CAV), pp.403-418, 2000.
DOI : 10.1007/10722167_31
URL : https://hal.archives-ouvertes.fr/hal-00159512

D. Brand and P. Zafiropulo, On Communicating Finite-State Machines, Journal of the ACM, vol.30, issue.2, pp.323-342, 1983.
DOI : 10.1145/322374.322380

S. Eilenberg, C. C. Elgot, and J. C. Shepherdson, Sets recognized by n-tape automata, Journal of Algebra, vol.13, issue.4, pp.447-464, 1969.
DOI : 10.1016/0021-8693(69)90107-0
URL : http://doi.org/10.1016/0021-8693(69)90107-0

C. Frougny and J. Sakarovitch, Synchronized rational relations of finite and infinite words, Theoretical Computer Science, vol.108, issue.1, pp.45-82, 1993.
DOI : 10.1016/0304-3975(93)90230-Q

P. Ganty and R. Majumdar, Algorithmic verification of asynchronous programs, ACM Transactions on Programming Languages and Systems, vol.34, issue.1, 2010.
DOI : 10.1145/2160910.2160915

E. M. Gold, Language identification in the limit, Information and Control, vol.10, issue.5, pp.447-474, 1967.
DOI : 10.1016/S0019-9958(67)91165-5

S. Graf and H. Sa¨?disa¨?di, Construction of abstract state graphs with PVS, Intl. Conf. on Computer Aided Verification (CAV), pp.72-83, 1997.
DOI : 10.1007/3-540-63166-6_10

T. Harju and J. Karhumäki, The equivalence problem of multitape finite automata, Theoretical Computer Science, vol.78, issue.2, pp.347-355, 1991.
DOI : 10.1016/0304-3975(91)90356-7

J. L. Hill, R. Szewczyk, A. Woo, S. Hollar, D. E. Culler et al., System architecture directions for networked sensors, Intl. Conf. on Architectural Support for Programming Languages and Operating Systems (ASPLOS), pp.93-104, 2000.
DOI : 10.1145/384264.379006
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.117.697

E. Kohler, R. Morris, B. Chen, J. Jannotti, and M. F. Kaashoek, The click modular router, ACM Transactions on Computer Systems, vol.18, issue.3, pp.263-297, 2000.
DOI : 10.1145/354871.354874

S. , L. Torre, P. Madhusudan, and G. Parlato, Context-bounded analysis of concurrent queue systems, Intl. Conf. on Tools and Algorithms for the Construction and Analysis of Systems (TACAS), pp.299-314, 2008.

V. S. Pai, P. Druschel, and W. Zwaenepoel, Flash: An efficient and portable Web server, USENIX Annual Technical Conference, pp.199-212, 1999.

S. Qadeer and J. Rehof, Context-Bounded Model Checking of Concurrent Software, Intl. Conf. on Tools and Algorithms for the Construction and Analysis of Systems (TACAS), pp.93-107, 2005.
DOI : 10.1007/978-3-540-31980-1_7

M. O. Rabin and D. Scott, Finite Automata and Their Decision Problems, IBM Journal of Research and Development, vol.3, issue.2, pp.114-125, 1959.
DOI : 10.1147/rd.32.0114
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.88.4472

G. Ramalingam, Context-sensitive synchronization-sensitive analysis is undecidable, ACM Transactions on Programming Languages and Systems, vol.22, issue.2, pp.416-430, 2000.
DOI : 10.1145/349214.349241
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.121.538

J. Raskin and F. Servais, Visibly Pushdown Transducers, Intl. Colloquium on Automata, Languages and Programming (ICALP), Part II, pp.386-397, 2008.
DOI : 10.1007/978-3-540-70583-3_32
URL : https://hal.archives-ouvertes.fr/inria-00492241

K. Sen and M. Viswanathan, Model Checking Multithreaded Programs with Asynchronous Atomic Methods, Intl. Conf. on Computer Aided Verification (CAV), pp.300-314, 2006.
DOI : 10.1007/11817963_29

W. Thomas, On logical definability of trace languages, ASMICS workshop, pp.172-182, 1990.

A. Vardhan, K. Sen, M. Viswanathan, and G. Agha, Learning to Verify Safety Properties, Intl. Conf. on Formal Engineering Methods (ICFEM), pp.274-289, 2004.
DOI : 10.1007/978-3-540-30482-1_26
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.2.786