Blondin, Michael; Finkel, Alain; Goubault-Larrecq, Jean Forward analysis for WSTS. III: Karp-Miller trees. (English) Zbl 07215292 Log. Methods Comput. Sci. 16, No. 2, Paper No. 13, 33 p. (2020). MSC: 03B70 68 PDF BibTeX XML Cite \textit{M. Blondin} et al., Log. Methods Comput. Sci. 16, No. 2, Paper No. 13, 33 p. (2020; Zbl 07215292) Full Text: Link arXiv
Gupta, Aarti; Kahlon, Vineet; Qadeer, Shaz; Touili, Tayssir Model checking concurrent programs. (English) Zbl 1392.68251 Clarke, Edmund M. (ed.) et al., Handbook of model checking. Cham: Springer (ISBN 978-3-319-10574-1/hbk; 978-3-319-10575-8/ebook). 573-611 (2018). MSC: 68Q60 68N30 PDF BibTeX XML Cite \textit{A. Gupta} et al., in: Handbook of model checking. Cham: Springer. 573--611 (2018; Zbl 1392.68251) Full Text: DOI
Etessami, Kousha; Stewart, Alistair; Yannakakis, Mihalis Greatest fixed points of probabilistic min/max polynomial equations, and reachability for branching Markov decision processes. (English) Zbl 1394.60085 Inf. Comput. 261, Part 2, 355-382 (2018). MSC: 60J80 PDF BibTeX XML Cite \textit{K. Etessami} et al., Inf. Comput. 261, Part 2, 355--382 (2018; Zbl 1394.60085) Full Text: DOI
Lengál, Ondřej; Lin, Anthony W.; Majumdar, Rupak; Rümmer, Philipp Fair termination for parameterized probabilistic concurrent systems. (English) Zbl 1452.68127 Legay, Axel (ed.) et al., Tools and algorithms for the construction and analysis of systems. 23rd international conference, TACAS 2017, held as part of the European joint conferences on theory and practice of software, ETAPS 2017, Uppsala, Sweden, April 22–29, 2017. Proceedings. Part I. Berlin: Springer. Lect. Notes Comput. Sci. 10205, 499-517 (2017). MSC: 68Q85 68Q60 68Q87 PDF BibTeX XML Cite \textit{O. Lengál} et al., Lect. Notes Comput. Sci. 10205, 499--517 (2017; Zbl 1452.68127) Full Text: DOI
Akshay, S.; Chakraborty, Supratik; Das, Ankush; Jagannath, Vishal; Sandeep, Sai On Petri nets with hierarchical special arcs. (English) Zbl 1442.68122 Meyer, Roland (ed.) et al., 28th international conference on concurrency theory. CONCUR 2017, Berlin, Germany, September 5–8, 2017. Proceedings. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 85, Article 40, 17 p. (2017). MSC: 68Q85 PDF BibTeX XML Cite \textit{S. Akshay} et al., LIPIcs -- Leibniz Int. Proc. Inform. 85, Article 40, 17 p. (2017; Zbl 1442.68122) Full Text: DOI
Lasota, Sławomir; Poturalski, Marcin Undecidability of performance equivalence of Petri nets. (English) Zbl 1356.68155 Theor. Comput. Sci. 655, Part B, 109-119 (2016). MSC: 68Q85 PDF BibTeX XML Cite \textit{S. Lasota} and \textit{M. Poturalski}, Theor. Comput. Sci. 655, Part B, 109--119 (2016; Zbl 1356.68155) Full Text: DOI
Zetzsche, Georg An approach to computing downward closures. (English) Zbl 1440.68166 Halldórsson, Magnús M. (ed.) et al., Automata, languages, and programming. 42nd international colloquium, ICALP 2015, Kyoto, Japan, July 6–10, 2015. Proceedings. Part II. Berlin: Springer. Lect. Notes Comput. Sci. 9135, 440-451 (2015). MSC: 68Q45 PDF BibTeX XML Cite \textit{G. Zetzsche}, Lect. Notes Comput. Sci. 9135, 440--451 (2015; Zbl 1440.68166) Full Text: DOI
Etessami, Kousha; Stewart, Alistair; Yannakakis, Mihalis Greatest fixed points of probabilistic min/max polynomial equations, and reachability for branching Markov decision processes. (English) Zbl 1394.60084 Halldórsson, Magnús M. (ed.) et al., Automata, languages, and programming. 42nd international colloquium, ICALP 2015, Kyoto, Japan, July 6–10, 2015. Proceedings. Part II. Berlin: Springer (ISBN 978-3-662-47665-9/pbk; 978-3-662-47666-6/ebook). Lecture Notes in Computer Science 9135, 184-196 (2015). MSC: 60J80 PDF BibTeX XML Cite \textit{K. Etessami} et al., Lect. Notes Comput. Sci. 9135, 184--196 (2015; Zbl 1394.60084) Full Text: DOI arXiv
Verlan, Sergey Universality in molecular and cellular computing. (English) Zbl 06496607 Beckmann, Arnold (ed.) et al., Evolving computability. 11th conference on computability in Europe, CiE 2015, Bucharest, Romania, June 29 – July 3, 2015. Proceedings. Cham: Springer (ISBN 978-3-319-20027-9/pbk; 978-3-319-20028-6/ebook). Lecture Notes in Computer Science 9136, 95-104 (2015). MSC: 68Qxx PDF BibTeX XML Cite \textit{S. Verlan}, Lect. Notes Comput. Sci. 9136, 95--104 (2015; Zbl 06496607) Full Text: DOI
Demri, Stéphane On selective unboundedness of VASS. (English) Zbl 1285.68094 J. Comput. Syst. Sci. 79, No. 5, 689-713 (2013). MSC: 68Q60 PDF BibTeX XML Cite \textit{S. Demri}, J. Comput. Syst. Sci. 79, No. 5, 689--713 (2013; Zbl 1285.68094) Full Text: DOI