×

Found 5 Documents (Results 1–5)

Approaching the coverability problem continuously. (English) Zbl 1420.68144

Chechik, Marsha (ed.) et al., Tools and algorithms for the construction and analysis of systems. 22nd international conference, TACAS 2016, held as part of the European joint conferences on theory and practice of software, ETAPS 2016, Eindhoven, The Netherlands, April 2–8, 2016. Proceedings. Berlin: Springer. Lect. Notes Comput. Sci. 9636, 480-496 (2016).
MSC:  68Q85 68Q60
PDFBibTeX XMLCite
Full Text: DOI arXiv

Reachability in two-dimensional vector addition systems with states is PSPACE-complete. (English) Zbl 1401.68095

Proceedings of the 2015 30th annual ACM/IEEE symposium on logic in computer science, LICS 2015, Kyoto, Japan, July 6–10, 2015. Los Alamitos, CA: IEEE Computer Society (ISBN 978-1-4799-8875-4). 32-43 (2015).
MSC:  68Q17 68Q25 68Q85
PDFBibTeX XMLCite
Full Text: DOI arXiv

Reachability in register machines with polynomial updates. (English) Zbl 1398.68160

Chatterjee, Krishnendu (ed.) et al., Mathematical foundations of computer science 2013. 38th international symposium, MFCS 2013, Klosterneuburg, Austria, August 26–30, 2013. Proceedings. Berlin: Springer (ISBN 978-3-642-40312-5/pbk). Lecture Notes in Computer Science 8087, 409-420 (2013).
MSC:  68Q05 68Q17 68Q25
PDFBibTeX XMLCite
Full Text: DOI

Filter Results by …

Document Type

Year of Publication

Main Field