Author:
Goubault-Larrecq Jean,Halfon Simon,Karandikar Prateek,Narayan Kumar K.,Schnoebelen Philippe
Publisher
Springer International Publishing
Reference61 articles.
1. Abdulla, P. A., Atig, M. F., & Cederberg, J. (2012). Timed lossy channel systems. In FST&TCS 2012, LIPIcs 18 (pp. 374–386). Leibniz-Zentrum für Informatik.
2. Abdulla, P. A., Čerāns, K., Jonsson, B., & Tsay, Y.-K. (2000). Algorithmic analysis of programs with well quasi-ordered domains. Information and Computation, 160(1/2), 109–127.
3. Abdulla, P. A., Collomb-Annichini, A., Bouajjani, A., & Jonsson, B. (2004). Using forward reachability analysis for verification of lossy channel systems. Formal Methods in System Design, 25(1), 39–65.
4. Akama, Y. (2011). Set systems: Order types, continuous nondeterministic deformations, and quasi-orders. Theoretical Computer Science, 412(45), 6235–6251.
5. Bachmeier, G., Luttenberger, M., & Schlund, M. (2015). Finite automata for the sub- and superword closure of CFLs: Descriptional and computational complexity. LATA 2015, LNCS 8977 (pp. 473–485). Cham: Springer.
Cited by
1 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献