The complexity of bounded context switching with dynamic thread creation

DOI10.4230/LIPICS.ICALP.2020.111MaRDI QIDQ6842459zbMATH OpenFDO

Authors Pascal Baumann, Rupak Majumdar, Ramanathan S. Thinniyam, Georg Zetzsche

Publication date 18 March 2026

Copyright license Creative Commons Attribution 3.0 Unported

zbMATH Keywords

complexityPetri netssafety verificationsuccinctnessasynchronous programsdynamic thread creationstate reachabilitybounded context switchingcounter programs

Mathematics Subject Classification ID

Theory of software (68Nxx) Theory of computing (68Qxx)

This page was built for publication: The complexity of bounded context switching with dynamic thread creation

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6842459)