Džamonja, Mirna; Schmitz, Sylvain; Schnoebelen, Philippe On ordinal invariants in well quasi orders and finite antichain orders. (English) Zbl 07218737 Schuster, Peter M. (ed.) et al., Well-quasi orders in computation, logic, language and reasoning. A unifying concept of proof theory, automata theory, formal languages and descriptive set theory. Based on the minisymposium on well-quasi orders: from theory to applications within the Jahrestagung der Deutschen Mathematiker-Vereinigung (DMV), Hamburg, Germany, September 21–25, 2015 and the Dagstuhl seminar 16031 on well quasi-orders in computer science, Schloss Dagstuhl, Germany, January 17–22, 2016. Cham: Springer (ISBN 978-3-030-30228-3/hbk; 978-3-030-30229-0/ebook). Trends in Logic – Studia Logica Library 53, 29-54 (2020). MSC: 03E 06A PDF BibTeX XML Cite \textit{M. Džamonja} et al., Trends Log. Stud. Log. Libr. 53, 29--54 (2020; Zbl 07218737) Full Text: DOI
Haase, Christoph; Schmitz, Sylvain; Schnoebelen, Philippe The power of priority channel systems. (English) Zbl 1448.68341 Log. Methods Comput. Sci. 10, No. 4, Paper No. 4, 39 p. (2014). MSC: 68Q85 PDF BibTeX XML Cite \textit{C. Haase} et al., Log. Methods Comput. Sci. 10, No. 4, Paper No. 4, 39 p. (2014; Zbl 1448.68341) Full Text: DOI
Haase, Christoph; Schmitz, Sylvain; Schnoebelen, Philippe The power of priority channel systems. (English) Zbl 1390.68471 D’Argenio, Pedro R. (ed.) et al., CONCUR 2013 – concurrency theory. 24th international conference, CONCUR 2013, Buenos Aires, Argentina, August 27–30, 2013. Proceedings. Berlin: Springer (ISBN 978-3-642-40183-1/pbk). Lecture Notes in Computer Science 8052, 319-333 (2013). MSC: 68Q85 PDF BibTeX XML Cite \textit{C. Haase} et al., Lect. Notes Comput. Sci. 8052, 319--333 (2013; Zbl 1390.68471) Full Text: DOI
Schmitz, Sylvain; Schnoebelen, Philippe The power of well-structured systems. (English) Zbl 1390.68488 D’Argenio, Pedro R. (ed.) et al., CONCUR 2013 – concurrency theory. 24th international conference, CONCUR 2013, Buenos Aires, Argentina, August 27–30, 2013. Proceedings. Berlin: Springer (ISBN 978-3-642-40183-1/pbk). Lecture Notes in Computer Science 8052, 5-24 (2013). MSC: 68Q85 68Q25 68Q60 PDF BibTeX XML Cite \textit{S. Schmitz} and \textit{P. Schnoebelen}, Lect. Notes Comput. Sci. 8052, 5--24 (2013; Zbl 1390.68488) Full Text: DOI
Haddad, Serge; Schmitz, Sylvain; Schnoebelen, Philippe The ordinal-recursive complexity of timed-arc Petri nets, data nets, and other enriched nets. (English) Zbl 1362.68214 Proceedings of the 2012 27th annual ACM/IEEE symposium on logic in computer science, LICS 2012, Dubrovnik, Croatia, June 25–28, 2012. Los Alamitos, CA: IEEE Computer Society (ISBN 978-0-7695-4769-5). 355-364 (2012). MSC: 68Q85 03D20 68Q17 68Q60 PDF BibTeX XML Cite \textit{S. Haddad} et al., in: Proceedings of the 2012 27th annual ACM/IEEE symposium on logic in computer science, LICS 2012, Dubrovnik, Croatia, June 25--28, 2012. Los Alamitos, CA: IEEE Computer Society. 355--364 (2012; Zbl 1362.68214) Full Text: DOI
Schmitz, S.; Schnoebelen, Ph. Multiply-recursive upper bounds with Higman’s lemma. (English) Zbl 1333.68179 Aceto, Luca (ed.) et al., Automata, languages and programming. 38th international colloquium, ICALP 2011, Zurich, Switzerland, July 4–8, 2011. Proceedings, Part II. Berlin: Springer (ISBN 978-3-642-22011-1/pbk). Lecture Notes in Computer Science 6756, 441-452 (2011). MSC: 68Q60 03D20 03E05 PDF BibTeX XML Cite \textit{S. Schmitz} and \textit{Ph. Schnoebelen}, Lect. Notes Comput. Sci. 6756, 441--452 (2011; Zbl 1333.68179) Full Text: DOI