Article ID | Journal | Published Year | Pages | File Type |
---|---|---|---|---|
434227 | Science of Computer Programming | 2014 | 22 Pages |
The application of Discrete-Event Systems (DES) theory to the problem of guaranteeably enforcing concurrency constraints in multithreaded applications has been studied under certain assumptions, namely, the assumption of a static pool of pre-existing instantiated threads, whose creation and termination are not modeled. This work presents an extension of this case to handle dynamically instantiated and terminated threads using a Petri net formalism and an online limited-lookahead state-space search technique.
► We present an approach to control the execution of concurrent programs. ► Threads can be created and destroyed at run-time. ► Deadlock freedom is ensured under certain conditions. ► Techniques from Discrete-Event Control Theory are used. ► An online lookahead algorithm explores state space up a certain depth.