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

Full work available at URL https://doi.org/10.4230/LIPICS.ICALP.2020.111

zbMATH Keywords

asynchronous programsbounded context switchingcomplexitycounter programsdynamic thread creationPetri netssafety verificationstate reachabilitysuccinctness

Mathematics Subject Classification ID

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

Cites work

• A note on succinct representations of graphs
• Context-Bounded Analysis for Concurrent Programs with Dynamic Creation of Threads
• scientific article; zbMATH DE number 1302047 (Why is no real title available?)
• Reasoning about data repetitions with counter systems
• Reducing concurrent analysis under a context bound to sequential analysis
• Succinct representation of regular languages by Boolean automata
• Succinct representations of graphs
• The covering and boundedness problems for vector addition systems
• The language theory of bounded context-switching
• Tools and Algorithms for the Construction and Analysis of Systems
• Verification of Boolean programs with unbounded thread creation

Cited in

(2)

• Directed regular and context-free languages
• Model-checking parametric lock-sharing systems against regular constraints

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)