The theory of deadlock avoidance via discrete control
From MaRDI portal
Publication:5261522
DOI10.1145/1480881.1480913zbMath1315.68073OpenAlexW2067967561MaRDI QIDQ5261522
Yin Wang, Manjunath Kudlur, Scott A. Mahlke, Stéphane Lafortune, Terence Kelly
Publication date: 3 July 2015
Published in: Proceedings of the 36th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages (Search for Journal in Brave)
Full work available at URL: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.157.5659
parallel programmingconcurrent programmingdiscrete control theorymulticore processorsmultithreaded programmingdynamic deadlock avoidance
Related Items (5)
Graph Games and Reactive Synthesis ⋮ Concurrency bugs in multithreaded software: modeling and analysis using Petri nets ⋮ Integrating discrete controller synthesis into a reactive programming language compiler ⋮ A controller synthesis framework for automated service composition ⋮ Distributed Control of Discrete-Event Systems: A First Step
This page was built for publication: The theory of deadlock avoidance via discrete control